./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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-deagle/arithmetic_prog_bad.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:58:03,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:58:03,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:58:03,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:58:03,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:58:03,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:58:03,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:58:03,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:58:03,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:58:03,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:58:03,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:58:03,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:58:03,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:58:03,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:58:03,550 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:58:03,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:58:03,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:58:03,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:58:03,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:58:03,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:58:03,551 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:58:03,552 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:58:03,552 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:58:03,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:58:03,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:58:03,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:58:03,553 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:58:03,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:58:03,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:58:03,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:58:03,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:58:03,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:58:03,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:58:03,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:03,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:58:03,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:58:03,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:58:03,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:58:03,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:58:03,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:58:03,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:58:03,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:58:03,556 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2024-11-09 10:58:03,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:58:03,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:58:03,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:58:03,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:58:03,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:58:03,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-09 10:58:05,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:58:05,331 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:58:05,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-09 10:58:05,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de8b111a/22dd4ac0ecec4881a0546453fc8bbe1a/FLAGb84535dea [2024-11-09 10:58:05,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de8b111a/22dd4ac0ecec4881a0546453fc8bbe1a [2024-11-09 10:58:05,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:58:05,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:58:05,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:05,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:58:05,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:58:05,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:05,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33948337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05, skipping insertion in model container [2024-11-09 10:58:05,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:05,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:58:05,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:05,812 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:58:05,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:05,906 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:58:05,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05 WrapperNode [2024-11-09 10:58:05,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:05,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:05,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:58:05,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:58:05,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:05,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:05,952 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 262 [2024-11-09 10:58:05,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:05,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:58:05,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:58:05,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:58:05,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:05,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:05,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:05,994 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2024-11-09 10:58:05,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:05,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:06,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:06,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:06,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:06,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:06,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:58:06,021 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:58:06,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:58:06,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:58:06,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (1/1) ... [2024-11-09 10:58:06,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:06,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:06,056 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-09 10:58:06,058 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-09 10:58:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:58:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 10:58:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 10:58:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:58:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:58:06,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:58:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:58:06,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:58:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:58:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:58:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:58:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:58:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:58:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:58:06,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:58:06,094 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:58:06,208 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:58:06,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:58:06,465 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:58:06,465 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:58:07,266 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:58:07,267 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 10:58:07,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:07 BoogieIcfgContainer [2024-11-09 10:58:07,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:58:07,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:58:07,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:58:07,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:58:07,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:58:05" (1/3) ... [2024-11-09 10:58:07,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579ac211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:07, skipping insertion in model container [2024-11-09 10:58:07,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:05" (2/3) ... [2024-11-09 10:58:07,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579ac211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:07, skipping insertion in model container [2024-11-09 10:58:07,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:07" (3/3) ... [2024-11-09 10:58:07,274 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-11-09 10:58:07,287 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:58:07,288 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:58:07,288 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:58:07,332 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:58:07,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 100 flow [2024-11-09 10:58:07,412 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2024-11-09 10:58:07,413 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:58:07,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 7/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2024-11-09 10:58:07,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 43 transitions, 100 flow [2024-11-09 10:58:07,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 92 flow [2024-11-09 10:58:07,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:58:07,436 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;@10db7aaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:58:07,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 10:58:07,452 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:58:07,453 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2024-11-09 10:58:07,453 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:58:07,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:07,454 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:07,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:07,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:07,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1079441311, now seen corresponding path program 1 times [2024-11-09 10:58:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:07,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479359967] [2024-11-09 10:58:07,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:07,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:08,246 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-09 10:58:08,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:08,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479359967] [2024-11-09 10:58:08,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479359967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:08,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:08,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:08,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443559538] [2024-11-09 10:58:08,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:08,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:08,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:08,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:08,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:08,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-09 10:58:08,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-09 10:58:08,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:08,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-09 10:58:08,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:08,453 INFO L124 PetriNetUnfolderBase]: 441/787 cut-off events. [2024-11-09 10:58:08,453 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-09 10:58:08,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1508 conditions, 787 events. 441/787 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3703 event pairs, 173 based on Foata normal form. 20/778 useless extension candidates. Maximal degree in co-relation 1442. Up to 419 conditions per place. [2024-11-09 10:58:08,461 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 39 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-11-09 10:58:08,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 205 flow [2024-11-09 10:58:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-09 10:58:08,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2024-11-09 10:58:08,472 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 92 flow. Second operand 3 states and 89 transitions. [2024-11-09 10:58:08,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 205 flow [2024-11-09 10:58:08,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:58:08,478 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 90 flow [2024-11-09 10:58:08,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2024-11-09 10:58:08,483 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-09 10:58:08,483 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 90 flow [2024-11-09 10:58:08,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-09 10:58:08,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:08,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:08,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:58:08,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:08,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1219930273, now seen corresponding path program 1 times [2024-11-09 10:58:08,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:08,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027988770] [2024-11-09 10:58:08,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:08,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:08,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027988770] [2024-11-09 10:58:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027988770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:08,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:08,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905918063] [2024-11-09 10:58:08,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:08,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:08,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:08,849 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-09 10:58:08,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-09 10:58:08,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:08,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-09 10:58:08,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:08,976 INFO L124 PetriNetUnfolderBase]: 742/1327 cut-off events. [2024-11-09 10:58:08,977 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2024-11-09 10:58:08,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 1327 events. 742/1327 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6781 event pairs, 300 based on Foata normal form. 29/1324 useless extension candidates. Maximal degree in co-relation 964. Up to 697 conditions per place. [2024-11-09 10:58:08,984 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 40 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-11-09 10:58:08,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 219 flow [2024-11-09 10:58:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-09 10:58:08,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 10:58:08,985 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 90 flow. Second operand 3 states and 86 transitions. [2024-11-09 10:58:08,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 219 flow [2024-11-09 10:58:08,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:08,987 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 100 flow [2024-11-09 10:58:08,987 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2024-11-09 10:58:08,988 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2024-11-09 10:58:08,988 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 100 flow [2024-11-09 10:58:08,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-09 10:58:08,988 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:08,988 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:08,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:58:08,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:08,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 737018549, now seen corresponding path program 1 times [2024-11-09 10:58:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798586865] [2024-11-09 10:58:08,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:08,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:09,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798586865] [2024-11-09 10:58:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798586865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:09,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148156940] [2024-11-09 10:58:09,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:09,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:09,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:09,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-09 10:58:09,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-09 10:58:09,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:09,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-09 10:58:09,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:09,426 INFO L124 PetriNetUnfolderBase]: 428/900 cut-off events. [2024-11-09 10:58:09,426 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-11-09 10:58:09,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 900 events. 428/900 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4334 event pairs, 182 based on Foata normal form. 64/958 useless extension candidates. Maximal degree in co-relation 629. Up to 373 conditions per place. [2024-11-09 10:58:09,430 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 30 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2024-11-09 10:58:09,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2024-11-09 10:58:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-09 10:58:09,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2024-11-09 10:58:09,432 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 100 flow. Second operand 3 states and 83 transitions. [2024-11-09 10:58:09,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2024-11-09 10:58:09,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:09,434 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 114 flow [2024-11-09 10:58:09,434 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2024-11-09 10:58:09,434 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-11-09 10:58:09,434 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 114 flow [2024-11-09 10:58:09,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-09 10:58:09,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:09,435 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:09,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:58:09,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:09,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash 419044627, now seen corresponding path program 2 times [2024-11-09 10:58:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:09,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626098014] [2024-11-09 10:58:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:09,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626098014] [2024-11-09 10:58:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626098014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:58:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849003334] [2024-11-09 10:58:09,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:58:09,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:09,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:09,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:58:09,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 10:58:10,064 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:58:10,064 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:58:10,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:58:10,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 10:58:10,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:10,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849003334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:10,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 10:58:10,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-09 10:58:10,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789010474] [2024-11-09 10:58:10,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:10,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:10,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:10,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:10,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:58:10,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-09 10:58:10,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-09 10:58:10,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:10,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-09 10:58:10,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:10,189 INFO L124 PetriNetUnfolderBase]: 465/947 cut-off events. [2024-11-09 10:58:10,189 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-11-09 10:58:10,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 947 events. 465/947 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4679 event pairs, 324 based on Foata normal form. 1/936 useless extension candidates. Maximal degree in co-relation 805. Up to 778 conditions per place. [2024-11-09 10:58:10,193 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 25 selfloop transitions, 1 changer transitions 3/38 dead transitions. [2024-11-09 10:58:10,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 164 flow [2024-11-09 10:58:10,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-09 10:58:10,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2024-11-09 10:58:10,195 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 114 flow. Second operand 3 states and 67 transitions. [2024-11-09 10:58:10,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 164 flow [2024-11-09 10:58:10,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:10,197 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 100 flow [2024-11-09 10:58:10,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2024-11-09 10:58:10,198 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-11-09 10:58:10,198 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 100 flow [2024-11-09 10:58:10,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-09 10:58:10,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:10,198 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:10,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:58:10,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:10,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:10,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:10,403 INFO L85 PathProgramCache]: Analyzing trace with hash -555787655, now seen corresponding path program 1 times [2024-11-09 10:58:10,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:10,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656834961] [2024-11-09 10:58:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:10,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:10,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:10,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656834961] [2024-11-09 10:58:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656834961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:58:10,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124016840] [2024-11-09 10:58:10,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:10,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:10,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:10,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:58:10,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 10:58:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:11,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:58:11,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:11,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:58:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:11,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124016840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:58:11,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:58:11,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-09 10:58:11,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131216776] [2024-11-09 10:58:11,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:58:11,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:58:11,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:11,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:58:11,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:58:11,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-09 10:58:11,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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-09 10:58:11,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:11,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-09 10:58:11,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:11,486 INFO L124 PetriNetUnfolderBase]: 809/1573 cut-off events. [2024-11-09 10:58:11,486 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2024-11-09 10:58:11,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 1573 events. 809/1573 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7784 event pairs, 128 based on Foata normal form. 60/1627 useless extension candidates. Maximal degree in co-relation 3503. Up to 396 conditions per place. [2024-11-09 10:58:11,493 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 72 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2024-11-09 10:58:11,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 85 transitions, 403 flow [2024-11-09 10:58:11,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:58:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:58:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-09 10:58:11,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2024-11-09 10:58:11,495 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 100 flow. Second operand 5 states and 145 transitions. [2024-11-09 10:58:11,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 85 transitions, 403 flow [2024-11-09 10:58:11,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 85 transitions, 402 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:11,497 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 129 flow [2024-11-09 10:58:11,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2024-11-09 10:58:11,498 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-11-09 10:58:11,498 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 129 flow [2024-11-09 10:58:11,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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-09 10:58:11,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:11,499 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:11,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:58:11,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:11,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:11,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1167078389, now seen corresponding path program 2 times [2024-11-09 10:58:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:11,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806782914] [2024-11-09 10:58:11,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:11,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 10:58:11,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:11,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806782914] [2024-11-09 10:58:11,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806782914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:58:11,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243324059] [2024-11-09 10:58:11,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:58:11,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:11,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:11,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:58:11,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 10:58:12,344 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:58:12,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:58:12,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:58:12,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 10:58:12,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243324059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:12,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 10:58:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 10:58:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22135322] [2024-11-09 10:58:12,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:12,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:58:12,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:12,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:58:12,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:58:12,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-11-09 10:58:12,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-09 10:58:12,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:12,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-11-09 10:58:12,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:12,537 INFO L124 PetriNetUnfolderBase]: 747/1491 cut-off events. [2024-11-09 10:58:12,537 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2024-11-09 10:58:12,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 1491 events. 747/1491 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6769 event pairs, 198 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 3623. Up to 699 conditions per place. [2024-11-09 10:58:12,544 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 45 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2024-11-09 10:58:12,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 305 flow [2024-11-09 10:58:12,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:58:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:58:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-09 10:58:12,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.563953488372093 [2024-11-09 10:58:12,546 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 129 flow. Second operand 4 states and 97 transitions. [2024-11-09 10:58:12,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 305 flow [2024-11-09 10:58:12,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 294 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:12,548 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 148 flow [2024-11-09 10:58:12,548 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-09 10:58:12,549 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-11-09 10:58:12,549 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 148 flow [2024-11-09 10:58:12,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-09 10:58:12,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:12,549 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:12,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:58:12,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:12,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:12,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:12,751 INFO L85 PathProgramCache]: Analyzing trace with hash -42528821, now seen corresponding path program 3 times [2024-11-09 10:58:12,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:12,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317561144] [2024-11-09 10:58:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:12,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:13,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:13,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317561144] [2024-11-09 10:58:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317561144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:58:13,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727041727] [2024-11-09 10:58:13,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:58:13,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:13,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:13,010 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:58:13,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 10:58:13,466 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-09 10:58:13,466 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:58:13,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:58:13,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:13,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:58:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:13,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727041727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:58:13,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:58:13,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-09 10:58:13,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051026844] [2024-11-09 10:58:13,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:58:13,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:58:13,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:13,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:58:13,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:58:13,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-09 10:58:13,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-09 10:58:13,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:13,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-09 10:58:13,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:13,783 INFO L124 PetriNetUnfolderBase]: 1206/2409 cut-off events. [2024-11-09 10:58:13,783 INFO L125 PetriNetUnfolderBase]: For 1453/1453 co-relation queries the response was YES. [2024-11-09 10:58:13,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 2409 events. 1206/2409 cut-off events. For 1453/1453 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 12874 event pairs, 162 based on Foata normal form. 115/2514 useless extension candidates. Maximal degree in co-relation 6059. Up to 831 conditions per place. [2024-11-09 10:58:13,796 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 73 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2024-11-09 10:58:13,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 88 transitions, 506 flow [2024-11-09 10:58:13,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:58:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:58:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-11-09 10:58:13,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2024-11-09 10:58:13,798 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 148 flow. Second operand 5 states and 140 transitions. [2024-11-09 10:58:13,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 88 transitions, 506 flow [2024-11-09 10:58:13,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 505 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:13,802 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 177 flow [2024-11-09 10:58:13,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2024-11-09 10:58:13,802 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2024-11-09 10:58:13,802 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 177 flow [2024-11-09 10:58:13,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-09 10:58:13,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:13,803 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:13,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 10:58:14,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:14,004 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:14,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash -298713313, now seen corresponding path program 4 times [2024-11-09 10:58:14,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:14,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496069189] [2024-11-09 10:58:14,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:14,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:58:14,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:14,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496069189] [2024-11-09 10:58:14,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496069189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:58:14,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023931698] [2024-11-09 10:58:14,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:58:14,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:14,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:14,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:58:14,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 10:58:14,925 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:58:14,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:58:14,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:58:14,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 10:58:14,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:58:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 10:58:15,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023931698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:58:15,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:58:15,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-11-09 10:58:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554878309] [2024-11-09 10:58:15,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:58:15,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:58:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:15,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:58:15,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:58:15,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-11-09 10:58:15,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-09 10:58:15,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:15,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-11-09 10:58:15,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:15,165 INFO L124 PetriNetUnfolderBase]: 448/983 cut-off events. [2024-11-09 10:58:15,165 INFO L125 PetriNetUnfolderBase]: For 1117/1119 co-relation queries the response was YES. [2024-11-09 10:58:15,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 983 events. 448/983 cut-off events. For 1117/1119 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4018 event pairs, 123 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 2770. Up to 436 conditions per place. [2024-11-09 10:58:15,170 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 46 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-11-09 10:58:15,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 356 flow [2024-11-09 10:58:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:58:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:58:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-11-09 10:58:15,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5523255813953488 [2024-11-09 10:58:15,171 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 177 flow. Second operand 4 states and 95 transitions. [2024-11-09 10:58:15,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 356 flow [2024-11-09 10:58:15,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 344 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:15,174 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 167 flow [2024-11-09 10:58:15,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2024-11-09 10:58:15,174 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-11-09 10:58:15,175 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 167 flow [2024-11-09 10:58:15,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-09 10:58:15,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:15,175 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:15,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 10:58:15,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:15,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:15,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1457335247, now seen corresponding path program 5 times [2024-11-09 10:58:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062963688] [2024-11-09 10:58:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:58:15,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:58:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:58:15,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:58:15,626 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:58:15,627 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-09 10:58:15,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-09 10:58:15,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-09 10:58:15,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-09 10:58:15,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:58:15,629 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2024-11-09 10:58:15,703 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:58:15,704 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:58:15,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:58:15 BasicIcfg [2024-11-09 10:58:15,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:58:15,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:58:15,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:58:15,708 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:58:15,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:07" (3/4) ... [2024-11-09 10:58:15,711 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:58:15,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:58:15,712 INFO L158 Benchmark]: Toolchain (without parser) took 10342.13ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 817.9MB). Free memory was 168.7MB in the beginning and 926.8MB in the end (delta: -758.1MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-11-09 10:58:15,712 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 130.0MB. Free memory was 90.2MB in the beginning and 90.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:58:15,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.58ms. Allocated memory is still 201.3MB. Free memory was 168.7MB in the beginning and 138.0MB in the end (delta: 30.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 10:58:15,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.31ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 135.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:58:15,713 INFO L158 Benchmark]: Boogie Preprocessor took 67.81ms. Allocated memory is still 201.3MB. Free memory was 135.1MB in the beginning and 130.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:58:15,713 INFO L158 Benchmark]: RCFGBuilder took 1246.07ms. Allocated memory was 201.3MB in the beginning and 253.8MB in the end (delta: 52.4MB). Free memory was 130.9MB in the beginning and 154.2MB in the end (delta: -23.3MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2024-11-09 10:58:15,713 INFO L158 Benchmark]: TraceAbstraction took 8438.88ms. Allocated memory was 253.8MB in the beginning and 1.0GB in the end (delta: 765.5MB). Free memory was 154.2MB in the beginning and 927.8MB in the end (delta: -773.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:58:15,714 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 1.0GB. Free memory was 927.8MB in the beginning and 926.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:58:15,715 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.11ms. Allocated memory is still 130.0MB. Free memory was 90.2MB in the beginning and 90.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.58ms. Allocated memory is still 201.3MB. Free memory was 168.7MB in the beginning and 138.0MB in the end (delta: 30.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.31ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 135.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.81ms. Allocated memory is still 201.3MB. Free memory was 135.1MB in the beginning and 130.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1246.07ms. Allocated memory was 201.3MB in the beginning and 253.8MB in the end (delta: 52.4MB). Free memory was 130.9MB in the beginning and 154.2MB in the end (delta: -23.3MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8438.88ms. Allocated memory was 253.8MB in the beginning and 1.0GB in the end (delta: 765.5MB). Free memory was 154.2MB in the beginning and 927.8MB in the end (delta: -773.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 1.0GB. Free memory was 927.8MB in the beginning and 926.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=-2, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=-2, t2=-1, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=-2, t2=-1, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] [L18] 0 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] - UnprovableResult [Line: 906]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 913]: 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: 914]: 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 5 procedures, 59 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.3s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 582 IncrementalHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 4 mSDtfsCounter, 582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 308 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 487 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 543 ConstructedInterpolants, 0 QuantifiedInterpolants, 1217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2150 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 192/270 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-09 10:58:15,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-deagle/arithmetic_prog_bad.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:58:17,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:58:18,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:58:18,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:58:18,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:58:18,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:58:18,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:58:18,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:58:18,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:58:18,102 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:58:18,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:58:18,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:58:18,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:58:18,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:58:18,104 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:58:18,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:58:18,105 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:58:18,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:58:18,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:58:18,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:58:18,106 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:58:18,107 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:58:18,107 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:58:18,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:58:18,108 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:58:18,108 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:58:18,108 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:58:18,108 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:58:18,108 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:58:18,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:58:18,109 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:58:18,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:58:18,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:58:18,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:58:18,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:58:18,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:18,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:58:18,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:58:18,111 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:58:18,111 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:58:18,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:58:18,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:58:18,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:58:18,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:58:18,113 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2024-11-09 10:58:18,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:58:18,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:58:18,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:58:18,392 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:58:18,393 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:58:18,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-09 10:58:19,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:58:19,975 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:58:19,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-09 10:58:19,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d1257ec/de15e37ace06422bbbee0ba5e1bdcd36/FLAG76ad14088 [2024-11-09 10:58:20,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d1257ec/de15e37ace06422bbbee0ba5e1bdcd36 [2024-11-09 10:58:20,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:58:20,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:58:20,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:20,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:58:20,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:58:20,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3053f2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20, skipping insertion in model container [2024-11-09 10:58:20,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:58:20,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:20,600 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:58:20,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:20,779 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:58:20,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20 WrapperNode [2024-11-09 10:58:20,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:20,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:20,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:58:20,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:58:20,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,840 INFO L138 Inliner]: procedures = 250, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 263 [2024-11-09 10:58:20,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:20,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:58:20,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:58:20,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:58:20,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,885 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2024-11-09 10:58:20,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,894 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:58:20,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:58:20,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:58:20,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:58:20,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (1/1) ... [2024-11-09 10:58:20,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:20,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:20,939 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-09 10:58:20,942 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-09 10:58:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:58:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 10:58:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 10:58:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 10:58:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 10:58:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 10:58:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:58:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:58:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:58:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:58:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 10:58:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 10:58:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:58:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:58:20,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:58:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:58:20,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:58:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:58:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:58:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:58:20,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:58:20,985 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:58:21,198 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:58:21,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:58:21,577 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:58:21,579 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:58:22,596 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:58:22,597 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 10:58:22,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:22 BoogieIcfgContainer [2024-11-09 10:58:22,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:58:22,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:58:22,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:58:22,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:58:22,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:58:20" (1/3) ... [2024-11-09 10:58:22,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ec2601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:22, skipping insertion in model container [2024-11-09 10:58:22,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:20" (2/3) ... [2024-11-09 10:58:22,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ec2601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:22, skipping insertion in model container [2024-11-09 10:58:22,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:22" (3/3) ... [2024-11-09 10:58:22,605 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-11-09 10:58:22,621 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:58:22,621 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:58:22,621 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:58:22,671 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:58:22,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 100 flow [2024-11-09 10:58:22,770 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2024-11-09 10:58:22,771 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:58:22,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 7/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2024-11-09 10:58:22,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 43 transitions, 100 flow [2024-11-09 10:58:22,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 92 flow [2024-11-09 10:58:22,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:58:22,786 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;@b88882e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:58:22,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 10:58:22,800 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:58:22,800 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2024-11-09 10:58:22,800 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:58:22,800 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:22,801 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:22,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:22,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1752607071, now seen corresponding path program 1 times [2024-11-09 10:58:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:22,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480737909] [2024-11-09 10:58:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:22,816 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-09 10:58:22,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:22,819 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-09 10:58:22,824 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-09 10:58:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:23,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:58:23,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:23,435 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-09 10:58:23,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:23,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:23,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480737909] [2024-11-09 10:58:23,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480737909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:23,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:23,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966345303] [2024-11-09 10:58:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:23,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:23,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:23,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:23,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-09 10:58:23,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-09 10:58:23,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:23,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-09 10:58:23,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:23,699 INFO L124 PetriNetUnfolderBase]: 454/794 cut-off events. [2024-11-09 10:58:23,699 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-09 10:58:23,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 794 events. 454/794 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3533 event pairs, 192 based on Foata normal form. 18/792 useless extension candidates. Maximal degree in co-relation 1466. Up to 432 conditions per place. [2024-11-09 10:58:23,707 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 39 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-11-09 10:58:23,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 205 flow [2024-11-09 10:58:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-09 10:58:23,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2024-11-09 10:58:23,717 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 92 flow. Second operand 3 states and 89 transitions. [2024-11-09 10:58:23,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 205 flow [2024-11-09 10:58:23,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:58:23,722 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 90 flow [2024-11-09 10:58:23,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2024-11-09 10:58:23,726 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-09 10:58:23,726 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 90 flow [2024-11-09 10:58:23,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-09 10:58:23,726 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:23,726 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-09 10:58:23,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:58:23,930 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-09 10:58:23,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:23,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash -346846753, now seen corresponding path program 1 times [2024-11-09 10:58:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:23,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114424846] [2024-11-09 10:58:23,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:23,933 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-09 10:58:23,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:23,936 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-09 10:58:23,940 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-09 10:58:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:24,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:58:24,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:24,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:24,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:24,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114424846] [2024-11-09 10:58:24,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114424846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:24,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:24,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:24,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799187097] [2024-11-09 10:58:24,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:24,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:24,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:24,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-09 10:58:24,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-09 10:58:24,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:24,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-09 10:58:24,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:24,640 INFO L124 PetriNetUnfolderBase]: 742/1327 cut-off events. [2024-11-09 10:58:24,640 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2024-11-09 10:58:24,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 1327 events. 742/1327 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6784 event pairs, 300 based on Foata normal form. 29/1324 useless extension candidates. Maximal degree in co-relation 964. Up to 697 conditions per place. [2024-11-09 10:58:24,648 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 40 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-11-09 10:58:24,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 219 flow [2024-11-09 10:58:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-09 10:58:24,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 10:58:24,649 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 90 flow. Second operand 3 states and 86 transitions. [2024-11-09 10:58:24,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 219 flow [2024-11-09 10:58:24,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:24,651 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 100 flow [2024-11-09 10:58:24,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2024-11-09 10:58:24,652 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2024-11-09 10:58:24,652 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 100 flow [2024-11-09 10:58:24,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-09 10:58:24,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:24,652 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:24,661 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-09 10:58:24,856 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-09 10:58:24,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:24,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:24,857 INFO L85 PathProgramCache]: Analyzing trace with hash 514794997, now seen corresponding path program 1 times [2024-11-09 10:58:24,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:24,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545360032] [2024-11-09 10:58:24,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:24,858 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-09 10:58:24,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:24,860 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-09 10:58:24,861 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-09 10:58:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:25,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:58:25,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:25,363 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-09 10:58:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:25,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:25,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:25,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545360032] [2024-11-09 10:58:25,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545360032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:25,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:25,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:25,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808972734] [2024-11-09 10:58:25,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:25,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:25,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:25,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:25,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:25,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-09 10:58:25,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-09 10:58:25,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:25,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-09 10:58:25,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:25,598 INFO L124 PetriNetUnfolderBase]: 428/905 cut-off events. [2024-11-09 10:58:25,598 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-11-09 10:58:25,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 905 events. 428/905 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4347 event pairs, 182 based on Foata normal form. 64/967 useless extension candidates. Maximal degree in co-relation 610. Up to 373 conditions per place. [2024-11-09 10:58:25,602 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 30 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2024-11-09 10:58:25,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2024-11-09 10:58:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-09 10:58:25,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2024-11-09 10:58:25,605 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 100 flow. Second operand 3 states and 83 transitions. [2024-11-09 10:58:25,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2024-11-09 10:58:25,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:25,608 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 114 flow [2024-11-09 10:58:25,608 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2024-11-09 10:58:25,609 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-11-09 10:58:25,609 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 114 flow [2024-11-09 10:58:25,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-09 10:58:25,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:25,610 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:25,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:58:25,810 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-09 10:58:25,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:25,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2014236483, now seen corresponding path program 2 times [2024-11-09 10:58:25,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:25,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964697997] [2024-11-09 10:58:25,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:58:25,813 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-09 10:58:25,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:25,814 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-09 10:58:25,815 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-09 10:58:26,260 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:58:26,260 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:58:26,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:58:26,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 10:58:26,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:26,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:26,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964697997] [2024-11-09 10:58:26,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964697997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:26,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:26,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:26,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033039145] [2024-11-09 10:58:26,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:26,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:26,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:26,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:26,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:26,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-09 10:58:26,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-09 10:58:26,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:26,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-09 10:58:26,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:26,418 INFO L124 PetriNetUnfolderBase]: 462/946 cut-off events. [2024-11-09 10:58:26,419 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2024-11-09 10:58:26,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2249 conditions, 946 events. 462/946 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4670 event pairs, 282 based on Foata normal form. 1/935 useless extension candidates. Maximal degree in co-relation 772. Up to 694 conditions per place. [2024-11-09 10:58:26,423 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 36 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2024-11-09 10:58:26,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 225 flow [2024-11-09 10:58:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-11-09 10:58:26,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5968992248062015 [2024-11-09 10:58:26,424 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 114 flow. Second operand 3 states and 77 transitions. [2024-11-09 10:58:26,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 225 flow [2024-11-09 10:58:26,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:26,426 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 106 flow [2024-11-09 10:58:26,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2024-11-09 10:58:26,427 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-11-09 10:58:26,427 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 106 flow [2024-11-09 10:58:26,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-09 10:58:26,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:26,428 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:26,432 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 (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:58:26,631 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-09 10:58:26,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:26,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1739470004, now seen corresponding path program 1 times [2024-11-09 10:58:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:26,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483464516] [2024-11-09 10:58:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:26,633 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-09 10:58:26,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:26,634 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-09 10:58:26,638 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-09 10:58:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:26,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:58:26,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:26,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:58:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:27,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:27,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483464516] [2024-11-09 10:58:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483464516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:58:27,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:58:27,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 10:58:27,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613248437] [2024-11-09 10:58:27,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:58:27,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:58:27,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:27,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:58:27,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:58:27,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-09 10:58:27,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-09 10:58:27,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:27,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-09 10:58:27,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:27,381 INFO L124 PetriNetUnfolderBase]: 809/1576 cut-off events. [2024-11-09 10:58:27,381 INFO L125 PetriNetUnfolderBase]: For 357/357 co-relation queries the response was YES. [2024-11-09 10:58:27,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3559 conditions, 1576 events. 809/1576 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7743 event pairs, 128 based on Foata normal form. 60/1630 useless extension candidates. Maximal degree in co-relation 3181. Up to 396 conditions per place. [2024-11-09 10:58:27,387 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 72 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2024-11-09 10:58:27,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 88 transitions, 415 flow [2024-11-09 10:58:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:58:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:58:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-09 10:58:27,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2024-11-09 10:58:27,389 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 106 flow. Second operand 5 states and 145 transitions. [2024-11-09 10:58:27,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 88 transitions, 415 flow [2024-11-09 10:58:27,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 88 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:27,392 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 135 flow [2024-11-09 10:58:27,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-11-09 10:58:27,396 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2024-11-09 10:58:27,396 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 135 flow [2024-11-09 10:58:27,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 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-09 10:58:27,396 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:27,396 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:27,407 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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:58:27,596 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-09 10:58:27,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:27,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:27,598 INFO L85 PathProgramCache]: Analyzing trace with hash 934677356, now seen corresponding path program 2 times [2024-11-09 10:58:27,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:27,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672963310] [2024-11-09 10:58:27,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:58:27,599 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-09 10:58:27,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:27,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:58:27,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:58:27,936 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:58:27,936 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:58:27,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:58:27,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 10:58:27,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:27,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:27,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672963310] [2024-11-09 10:58:27,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672963310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:27,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:27,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:58:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518671478] [2024-11-09 10:58:27,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:27,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:27,999 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-09 10:58:27,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-09 10:58:27,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:27,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-09 10:58:27,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:28,156 INFO L124 PetriNetUnfolderBase]: 686/1396 cut-off events. [2024-11-09 10:58:28,156 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2024-11-09 10:58:28,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3445 conditions, 1396 events. 686/1396 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7085 event pairs, 491 based on Foata normal form. 1/1378 useless extension candidates. Maximal degree in co-relation 1856. Up to 1123 conditions per place. [2024-11-09 10:58:28,166 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 26 selfloop transitions, 1 changer transitions 2/39 dead transitions. [2024-11-09 10:58:28,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 187 flow [2024-11-09 10:58:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-09 10:58:28,168 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2024-11-09 10:58:28,168 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 135 flow. Second operand 3 states and 67 transitions. [2024-11-09 10:58:28,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 187 flow [2024-11-09 10:58:28,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 181 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:28,172 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 125 flow [2024-11-09 10:58:28,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-11-09 10:58:28,174 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2024-11-09 10:58:28,174 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 125 flow [2024-11-09 10:58:28,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-09 10:58:28,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:28,175 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:28,183 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 (7)] Forceful destruction successful, exit code 0 [2024-11-09 10:58:28,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:58:28,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:28,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:28,376 INFO L85 PathProgramCache]: Analyzing trace with hash 496076111, now seen corresponding path program 1 times [2024-11-09 10:58:28,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:28,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441217090] [2024-11-09 10:58:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:28,377 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-09 10:58:28,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:28,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:58:28,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:58:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:28,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:58:28,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 10:58:28,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:58:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 10:58:28,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:28,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441217090] [2024-11-09 10:58:28,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441217090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:58:28,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:58:28,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 10:58:28,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56784329] [2024-11-09 10:58:28,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:58:28,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:58:28,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:28,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:58:28,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:58:28,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-09 10:58:28,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-09 10:58:28,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:28,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-09 10:58:28,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:29,324 INFO L124 PetriNetUnfolderBase]: 1159/2258 cut-off events. [2024-11-09 10:58:29,325 INFO L125 PetriNetUnfolderBase]: For 964/964 co-relation queries the response was YES. [2024-11-09 10:58:29,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5348 conditions, 2258 events. 1159/2258 cut-off events. For 964/964 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 12024 event pairs, 165 based on Foata normal form. 86/2330 useless extension candidates. Maximal degree in co-relation 5336. Up to 554 conditions per place. [2024-11-09 10:58:29,335 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 73 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2024-11-09 10:58:29,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 87 transitions, 472 flow [2024-11-09 10:58:29,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:58:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:58:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-11-09 10:58:29,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6604651162790698 [2024-11-09 10:58:29,337 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 125 flow. Second operand 5 states and 142 transitions. [2024-11-09 10:58:29,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 87 transitions, 472 flow [2024-11-09 10:58:29,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:29,341 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 154 flow [2024-11-09 10:58:29,341 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-11-09 10:58:29,342 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2024-11-09 10:58:29,342 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 154 flow [2024-11-09 10:58:29,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-09 10:58:29,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:29,343 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:29,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:58:29,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:58:29,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:29,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:29,544 INFO L85 PathProgramCache]: Analyzing trace with hash 331843383, now seen corresponding path program 2 times [2024-11-09 10:58:29,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:29,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271954092] [2024-11-09 10:58:29,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:58:29,545 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-09 10:58:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:29,549 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:58:29,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 10:58:29,912 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:58:29,912 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:58:29,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:58:29,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 10:58:29,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:58:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 10:58:29,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271954092] [2024-11-09 10:58:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271954092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:58:29,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:58:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2024-11-09 10:58:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647822224] [2024-11-09 10:58:29,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:58:29,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:58:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:29,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:58:29,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:58:29,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-11-09 10:58:29,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-09 10:58:29,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:29,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-11-09 10:58:29,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:30,151 INFO L124 PetriNetUnfolderBase]: 448/983 cut-off events. [2024-11-09 10:58:30,152 INFO L125 PetriNetUnfolderBase]: For 902/904 co-relation queries the response was YES. [2024-11-09 10:58:30,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 983 events. 448/983 cut-off events. For 902/904 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4019 event pairs, 123 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 2623. Up to 436 conditions per place. [2024-11-09 10:58:30,156 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 46 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-11-09 10:58:30,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 344 flow [2024-11-09 10:58:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:58:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:58:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-09 10:58:30,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.563953488372093 [2024-11-09 10:58:30,158 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 154 flow. Second operand 4 states and 97 transitions. [2024-11-09 10:58:30,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 344 flow [2024-11-09 10:58:30,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 332 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-09 10:58:30,160 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 163 flow [2024-11-09 10:58:30,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2024-11-09 10:58:30,160 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2024-11-09 10:58:30,161 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 163 flow [2024-11-09 10:58:30,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-09 10:58:30,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:30,161 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:30,176 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 (9)] Ended with exit code 0 [2024-11-09 10:58:30,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:58:30,363 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:58:30,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash -887040361, now seen corresponding path program 3 times [2024-11-09 10:58:30,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:30,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383703663] [2024-11-09 10:58:30,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:58:30,366 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-09 10:58:30,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:30,367 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:58:30,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 10:58:30,875 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 10:58:30,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 10:58:30,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:58:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:58:31,088 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:58:31,088 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:58:31,089 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-09 10:58:31,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-09 10:58:31,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-09 10:58:31,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-09 10:58:31,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 10:58:31,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:58:31,292 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1] [2024-11-09 10:58:31,344 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:58:31,345 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:58:31,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:58:31 BasicIcfg [2024-11-09 10:58:31,350 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:58:31,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:58:31,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:58:31,351 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:58:31,351 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:22" (3/4) ... [2024-11-09 10:58:31,353 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:58:31,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:58:31,354 INFO L158 Benchmark]: Toolchain (without parser) took 11343.59ms. Allocated memory was 92.3MB in the beginning and 738.2MB in the end (delta: 645.9MB). Free memory was 56.2MB in the beginning and 614.3MB in the end (delta: -558.1MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2024-11-09 10:58:31,354 INFO L158 Benchmark]: CDTParser took 1.60ms. Allocated memory is still 92.3MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:58:31,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 767.25ms. Allocated memory is still 92.3MB. Free memory was 56.0MB in the beginning and 52.2MB in the end (delta: 3.7MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-11-09 10:58:31,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.08ms. Allocated memory is still 92.3MB. Free memory was 52.2MB in the beginning and 49.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:58:31,355 INFO L158 Benchmark]: Boogie Preprocessor took 63.75ms. Allocated memory is still 92.3MB. Free memory was 49.0MB in the beginning and 44.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:58:31,355 INFO L158 Benchmark]: RCFGBuilder took 1689.56ms. Allocated memory was 92.3MB in the beginning and 167.8MB in the end (delta: 75.5MB). Free memory was 44.4MB in the beginning and 64.2MB in the end (delta: -19.8MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2024-11-09 10:58:31,356 INFO L158 Benchmark]: TraceAbstraction took 8750.55ms. Allocated memory was 167.8MB in the beginning and 738.2MB in the end (delta: 570.4MB). Free memory was 63.1MB in the beginning and 614.3MB in the end (delta: -551.2MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-09 10:58:31,356 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 738.2MB. Free memory is still 614.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:58:31,357 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.60ms. Allocated memory is still 92.3MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 767.25ms. Allocated memory is still 92.3MB. Free memory was 56.0MB in the beginning and 52.2MB in the end (delta: 3.7MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.08ms. Allocated memory is still 92.3MB. Free memory was 52.2MB in the beginning and 49.0MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.75ms. Allocated memory is still 92.3MB. Free memory was 49.0MB in the beginning and 44.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1689.56ms. Allocated memory was 92.3MB in the beginning and 167.8MB in the end (delta: 75.5MB). Free memory was 44.4MB in the beginning and 64.2MB in the end (delta: -19.8MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8750.55ms. Allocated memory was 167.8MB in the beginning and 738.2MB in the end (delta: 570.4MB). Free memory was 63.1MB in the beginning and 614.3MB in the end (delta: -551.2MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 738.2MB. Free memory is still 614.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=0, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=0, t2=1, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=0, t2=1, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=0, t2=1, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=0, t2=1, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) [L919] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] [L18] 0 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, total=6] - UnprovableResult [Line: 906]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 913]: 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: 914]: 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 5 procedures, 59 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.6s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 668 IncrementalHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 3 mSDtfsCounter, 668 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=8, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 293 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1727 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 147/159 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-09 10:58:31,381 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