./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-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-wip.dd.update-z3-fca748b-m [2024-11-20 17:51:13,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:51:13,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:51:13,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:51:13,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:51:13,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:51:13,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:51:13,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:51:13,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:51:13,103 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:51:13,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:51:13,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:51:13,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:51:13,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:51:13,106 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:51:13,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:51:13,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:51:13,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:51:13,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:51:13,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:51:13,116 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:51:13,116 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:51:13,116 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:51:13,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:51:13,117 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:51:13,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:51:13,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:51:13,118 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:51:13,118 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:51:13,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:51:13,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:51:13,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:51:13,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:51:13,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:51:13,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:51:13,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:51:13,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:51:13,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:51:13,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:51:13,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:51:13,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:51:13,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:51:13,124 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-20 17:51:13,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:51:13,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:51:13,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:51:13,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:51:13,342 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:51:13,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-20 17:51:14,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:51:14,810 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:51:14,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-20 17:51:14,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49aa093af/6531aded65334bd198e5c07495f88a18/FLAGe6586d3f7 [2024-11-20 17:51:14,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49aa093af/6531aded65334bd198e5c07495f88a18 [2024-11-20 17:51:14,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:51:14,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:51:14,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:51:14,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:51:14,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:51:14,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:51:14" (1/1) ... [2024-11-20 17:51:14,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34fc19f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:14, skipping insertion in model container [2024-11-20 17:51:14,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:51:14" (1/1) ... [2024-11-20 17:51:14,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:51:15,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:51:15,255 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:51:15,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:51:15,372 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:51:15,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15 WrapperNode [2024-11-20 17:51:15,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:51:15,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:51:15,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:51:15,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:51:15,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,422 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 262 [2024-11-20 17:51:15,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:51:15,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:51:15,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:51:15,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:51:15,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,462 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-20 17:51:15,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:51:15,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:51:15,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:51:15,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:51:15,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (1/1) ... [2024-11-20 17:51:15,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:51:15,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:51:15,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:51:15,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:51:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 17:51:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 17:51:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-20 17:51:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 17:51:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-20 17:51:15,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-20 17:51:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-20 17:51:15,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-20 17:51:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 17:51:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:51:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:51:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 17:51:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 17:51:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:51:15,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:51:15,579 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:51:15,721 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:51:15,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:51:15,951 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:51:15,951 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:51:16,825 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:51:16,826 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-20 17:51:16,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:51:16 BoogieIcfgContainer [2024-11-20 17:51:16,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:51:16,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:51:16,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:51:16,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:51:16,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:51:14" (1/3) ... [2024-11-20 17:51:16,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c65a63a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:51:16, skipping insertion in model container [2024-11-20 17:51:16,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:15" (2/3) ... [2024-11-20 17:51:16,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c65a63a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:51:16, skipping insertion in model container [2024-11-20 17:51:16,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:51:16" (3/3) ... [2024-11-20 17:51:16,834 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-11-20 17:51:16,848 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:51:16,848 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 17:51:16,848 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:51:16,895 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-20 17:51:16,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 100 flow [2024-11-20 17:51:16,959 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2024-11-20 17:51:16,959 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 17:51:16,962 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-20 17:51:16,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 43 transitions, 100 flow [2024-11-20 17:51:16,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 92 flow [2024-11-20 17:51:16,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:51:16,985 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;@2c5a8bbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:51:16,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-20 17:51:17,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:51:17,007 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2024-11-20 17:51:17,007 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 17:51:17,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:17,008 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:51:17,008 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-20 17:51:17,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1079441311, now seen corresponding path program 1 times [2024-11-20 17:51:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:51:17,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111993702] [2024-11-20 17:51:17,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:17,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:51:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:51:17,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:51:17,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111993702] [2024-11-20 17:51:17,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111993702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:51:17,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:51:17,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:51:17,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342608057] [2024-11-20 17:51:17,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:51:17,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:51:17,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:51:17,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:51:17,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:51:17,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-20 17:51:17,778 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-20 17:51:17,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:17,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-20 17:51:17,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:17,959 INFO L124 PetriNetUnfolderBase]: 441/787 cut-off events. [2024-11-20 17:51:17,960 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-20 17:51:17,962 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-20 17:51:17,966 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 39 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-11-20 17:51:17,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 205 flow [2024-11-20 17:51:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:51:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:51:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-20 17:51:17,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2024-11-20 17:51:17,978 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 92 flow. Second operand 3 states and 89 transitions. [2024-11-20 17:51:17,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 205 flow [2024-11-20 17:51:17,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:51:17,983 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 90 flow [2024-11-20 17:51:17,985 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-20 17:51:17,988 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-20 17:51:17,989 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 90 flow [2024-11-20 17:51:17,990 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-20 17:51:17,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:17,990 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:51:17,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:51:17,991 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-20 17:51:17,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1219930273, now seen corresponding path program 1 times [2024-11-20 17:51:17,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:51:17,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638136150] [2024-11-20 17:51:17,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:17,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:51:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:18,417 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-20 17:51:18,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:51:18,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638136150] [2024-11-20 17:51:18,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638136150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:51:18,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:51:18,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:51:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899767465] [2024-11-20 17:51:18,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:51:18,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:51:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:51:18,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:51:18,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:51:18,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-20 17:51:18,423 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-20 17:51:18,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:18,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-20 17:51:18,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:18,569 INFO L124 PetriNetUnfolderBase]: 742/1327 cut-off events. [2024-11-20 17:51:18,570 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2024-11-20 17:51:18,572 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-20 17:51:18,576 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 40 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-11-20 17:51:18,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 219 flow [2024-11-20 17:51:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:51:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:51:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-20 17:51:18,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-20 17:51:18,578 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 90 flow. Second operand 3 states and 86 transitions. [2024-11-20 17:51:18,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 219 flow [2024-11-20 17:51:18,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:18,579 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 100 flow [2024-11-20 17:51:18,579 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-20 17:51:18,580 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2024-11-20 17:51:18,580 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 100 flow [2024-11-20 17:51:18,580 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-20 17:51:18,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:18,581 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-20 17:51:18,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 17:51:18,581 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-20 17:51:18,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash 737018549, now seen corresponding path program 1 times [2024-11-20 17:51:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:51:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16644229] [2024-11-20 17:51:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:51:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:18,853 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-20 17:51:18,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:51:18,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16644229] [2024-11-20 17:51:18,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16644229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:51:18,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:51:18,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:51:18,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602647431] [2024-11-20 17:51:18,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:51:18,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:51:18,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:51:18,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:51:18,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:51:18,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-20 17:51:18,856 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-20 17:51:18,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:18,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-20 17:51:18,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:18,969 INFO L124 PetriNetUnfolderBase]: 428/900 cut-off events. [2024-11-20 17:51:18,969 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-11-20 17:51:18,971 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-20 17:51:18,973 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 30 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2024-11-20 17:51:18,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2024-11-20 17:51:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:51:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:51:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-20 17:51:18,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2024-11-20 17:51:18,974 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 100 flow. Second operand 3 states and 83 transitions. [2024-11-20 17:51:18,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2024-11-20 17:51:18,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:18,976 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 114 flow [2024-11-20 17:51:18,976 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-20 17:51:18,977 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-11-20 17:51:18,977 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 114 flow [2024-11-20 17:51:18,977 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-20 17:51:18,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:18,977 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-20 17:51:18,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:51:18,978 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-20 17:51:18,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash 419044627, now seen corresponding path program 2 times [2024-11-20 17:51:18,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:51:18,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835307181] [2024-11-20 17:51:18,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:18,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:51:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:19,216 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-20 17:51:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:51:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835307181] [2024-11-20 17:51:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835307181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:51:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601461828] [2024-11-20 17:51:19,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:51:19,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:51:19,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:51:19,219 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-20 17:51:19,224 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-20 17:51:19,737 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:51:19,737 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:51:19,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:51:19,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:19,798 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-20 17:51:19,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:51:19,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601461828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:51:19,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:51:19,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-20 17:51:19,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017225073] [2024-11-20 17:51:19,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:51:19,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:51:19,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:51:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:51:19,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:51:19,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-20 17:51:19,802 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-20 17:51:19,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:19,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-20 17:51:19,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:19,901 INFO L124 PetriNetUnfolderBase]: 465/947 cut-off events. [2024-11-20 17:51:19,901 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-11-20 17:51:19,903 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-20 17:51:19,906 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 25 selfloop transitions, 1 changer transitions 3/38 dead transitions. [2024-11-20 17:51:19,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 164 flow [2024-11-20 17:51:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:51:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:51:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-20 17:51:19,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2024-11-20 17:51:19,907 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 114 flow. Second operand 3 states and 67 transitions. [2024-11-20 17:51:19,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 164 flow [2024-11-20 17:51:19,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:19,910 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 100 flow [2024-11-20 17:51:19,910 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-20 17:51:19,911 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-11-20 17:51:19,911 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 100 flow [2024-11-20 17:51:19,911 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-20 17:51:19,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:19,911 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-20 17:51:19,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 17:51:20,112 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-20 17:51:20,112 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-20 17:51:20,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:20,113 INFO L85 PathProgramCache]: Analyzing trace with hash -555787655, now seen corresponding path program 1 times [2024-11-20 17:51:20,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:51:20,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903597666] [2024-11-20 17:51:20,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:20,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:51:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:20,433 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-20 17:51:20,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:51:20,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903597666] [2024-11-20 17:51:20,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903597666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:51:20,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304611596] [2024-11-20 17:51:20,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:20,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:51:20,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:51:20,436 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-20 17:51:20,437 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-20 17:51:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:20,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:51:20,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:20,901 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-20 17:51:20,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:51:20,931 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-20 17:51:20,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304611596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:51:20,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:51:20,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-20 17:51:20,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028998440] [2024-11-20 17:51:20,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:51:20,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:51:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:51:20,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:51:20,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:51:20,937 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-20 17:51:20,937 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-20 17:51:20,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:20,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-20 17:51:20,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:21,128 INFO L124 PetriNetUnfolderBase]: 809/1573 cut-off events. [2024-11-20 17:51:21,128 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2024-11-20 17:51:21,130 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-20 17:51:21,135 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 72 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2024-11-20 17:51:21,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 85 transitions, 403 flow [2024-11-20 17:51:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:51:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:51:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-20 17:51:21,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2024-11-20 17:51:21,136 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 100 flow. Second operand 5 states and 145 transitions. [2024-11-20 17:51:21,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 85 transitions, 403 flow [2024-11-20 17:51:21,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 85 transitions, 402 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:21,138 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 129 flow [2024-11-20 17:51:21,138 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-20 17:51:21,139 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-11-20 17:51:21,139 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 129 flow [2024-11-20 17:51:21,139 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-20 17:51:21,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:21,140 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-20 17:51:21,156 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-20 17:51:21,340 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-20 17:51:21,340 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-20 17:51:21,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:21,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1167078389, now seen corresponding path program 2 times [2024-11-20 17:51:21,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:51:21,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434189106] [2024-11-20 17:51:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:21,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:51:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:21,601 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-20 17:51:21,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:51:21,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434189106] [2024-11-20 17:51:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434189106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:51:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939088708] [2024-11-20 17:51:21,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:51:21,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:51:21,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:51:21,605 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-20 17:51:21,606 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-20 17:51:21,967 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 17:51:21,967 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:51:21,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:51:21,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:22,008 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-20 17:51:22,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:51:22,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939088708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:51:22,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:51:22,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-20 17:51:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340912968] [2024-11-20 17:51:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:51:22,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:51:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:51:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:51:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:51:22,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-11-20 17:51:22,012 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-20 17:51:22,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:22,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-11-20 17:51:22,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:22,183 INFO L124 PetriNetUnfolderBase]: 747/1491 cut-off events. [2024-11-20 17:51:22,184 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2024-11-20 17:51:22,186 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-20 17:51:22,189 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 45 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2024-11-20 17:51:22,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 305 flow [2024-11-20 17:51:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:51:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:51:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-20 17:51:22,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.563953488372093 [2024-11-20 17:51:22,191 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 129 flow. Second operand 4 states and 97 transitions. [2024-11-20 17:51:22,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 305 flow [2024-11-20 17:51:22,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 294 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:22,193 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 148 flow [2024-11-20 17:51:22,193 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-20 17:51:22,194 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-11-20 17:51:22,194 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 148 flow [2024-11-20 17:51:22,194 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-20 17:51:22,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:22,194 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-20 17:51:22,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 17:51:22,395 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-20 17:51:22,396 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-20 17:51:22,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash -42528821, now seen corresponding path program 3 times [2024-11-20 17:51:22,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:51:22,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930383601] [2024-11-20 17:51:22,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:51:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:22,678 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-20 17:51:22,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:51:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930383601] [2024-11-20 17:51:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930383601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:51:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532747573] [2024-11-20 17:51:22,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 17:51:22,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:51:22,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:51:22,681 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-20 17:51:22,681 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-20 17:51:23,185 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-20 17:51:23,186 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:51:23,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:51:23,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:23,223 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-20 17:51:23,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:51:23,262 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-20 17:51:23,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532747573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:51:23,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:51:23,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-20 17:51:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763262117] [2024-11-20 17:51:23,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:51:23,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:51:23,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:51:23,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:51:23,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:51:23,266 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-20 17:51:23,266 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-20 17:51:23,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:23,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-20 17:51:23,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:23,530 INFO L124 PetriNetUnfolderBase]: 1206/2409 cut-off events. [2024-11-20 17:51:23,530 INFO L125 PetriNetUnfolderBase]: For 1453/1453 co-relation queries the response was YES. [2024-11-20 17:51:23,535 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-20 17:51:23,544 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 73 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2024-11-20 17:51:23,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 88 transitions, 506 flow [2024-11-20 17:51:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:51:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:51:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-11-20 17:51:23,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2024-11-20 17:51:23,546 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 148 flow. Second operand 5 states and 140 transitions. [2024-11-20 17:51:23,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 88 transitions, 506 flow [2024-11-20 17:51:23,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 505 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:23,549 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 177 flow [2024-11-20 17:51:23,550 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-20 17:51:23,550 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2024-11-20 17:51:23,550 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 177 flow [2024-11-20 17:51:23,551 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-20 17:51:23,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:23,551 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-20 17:51:23,560 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-20 17:51:23,751 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-20 17:51:23,752 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-20 17:51:23,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash -298713313, now seen corresponding path program 4 times [2024-11-20 17:51:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:51:23,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388638302] [2024-11-20 17:51:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:51:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:24,205 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-20 17:51:24,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:51:24,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388638302] [2024-11-20 17:51:24,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388638302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:51:24,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561354778] [2024-11-20 17:51:24,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 17:51:24,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:51:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:51:24,209 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-20 17:51:24,210 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-20 17:51:24,699 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 17:51:24,699 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:51:24,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 17:51:24,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:24,738 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-20 17:51:24,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:51:24,778 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-20 17:51:24,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561354778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:51:24,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:51:24,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-11-20 17:51:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698687456] [2024-11-20 17:51:24,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:51:24,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:51:24,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:51:24,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:51:24,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:51:24,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-11-20 17:51:24,782 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-20 17:51:24,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:24,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-11-20 17:51:24,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:24,897 INFO L124 PetriNetUnfolderBase]: 448/983 cut-off events. [2024-11-20 17:51:24,897 INFO L125 PetriNetUnfolderBase]: For 1117/1119 co-relation queries the response was YES. [2024-11-20 17:51:24,899 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-20 17:51:24,902 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 46 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-11-20 17:51:24,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 356 flow [2024-11-20 17:51:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:51:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:51:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-11-20 17:51:24,904 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5523255813953488 [2024-11-20 17:51:24,904 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 177 flow. Second operand 4 states and 95 transitions. [2024-11-20 17:51:24,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 356 flow [2024-11-20 17:51:24,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 344 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:24,906 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 167 flow [2024-11-20 17:51:24,906 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-20 17:51:24,907 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-11-20 17:51:24,907 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 167 flow [2024-11-20 17:51:24,907 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-20 17:51:24,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:24,907 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-20 17:51:24,917 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-20 17:51:25,111 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-20 17:51:25,112 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-20 17:51:25,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:25,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1457335247, now seen corresponding path program 5 times [2024-11-20 17:51:25,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:51:25,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214371642] [2024-11-20 17:51:25,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:25,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:51:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:51:25,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:51:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:51:25,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 17:51:25,351 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:51:25,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-20 17:51:25,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-20 17:51:25,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-20 17:51:25,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-20 17:51:25,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 17:51:25,353 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2024-11-20 17:51:25,407 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:51:25,407 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:51:25,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:51:25 BasicIcfg [2024-11-20 17:51:25,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:51:25,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:51:25,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:51:25,412 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:51:25,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:51:16" (3/4) ... [2024-11-20 17:51:25,414 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:51:25,415 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:51:25,415 INFO L158 Benchmark]: Toolchain (without parser) took 10574.79ms. Allocated memory was 172.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 105.0MB in the beginning and 790.9MB in the end (delta: -685.9MB). Peak memory consumption was 409.0MB. Max. memory is 16.1GB. [2024-11-20 17:51:25,415 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:51:25,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.87ms. Allocated memory is still 172.0MB. Free memory was 104.8MB in the beginning and 135.1MB in the end (delta: -30.3MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-11-20 17:51:25,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.63ms. Allocated memory is still 172.0MB. Free memory was 135.1MB in the beginning and 132.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:51:25,419 INFO L158 Benchmark]: Boogie Preprocessor took 72.45ms. Allocated memory is still 172.0MB. Free memory was 132.4MB in the beginning and 128.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 17:51:25,420 INFO L158 Benchmark]: RCFGBuilder took 1327.60ms. Allocated memory was 172.0MB in the beginning and 278.9MB in the end (delta: 107.0MB). Free memory was 128.2MB in the beginning and 202.2MB in the end (delta: -74.0MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. [2024-11-20 17:51:25,420 INFO L158 Benchmark]: TraceAbstraction took 8583.93ms. Allocated memory was 278.9MB in the beginning and 1.3GB in the end (delta: 985.7MB). Free memory was 202.2MB in the beginning and 792.0MB in the end (delta: -589.8MB). Peak memory consumption was 395.9MB. Max. memory is 16.1GB. [2024-11-20 17:51:25,420 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 1.3GB. Free memory is still 790.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:51:25,421 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.13ms. Allocated memory is still 100.7MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.87ms. Allocated memory is still 172.0MB. Free memory was 104.8MB in the beginning and 135.1MB in the end (delta: -30.3MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.63ms. Allocated memory is still 172.0MB. Free memory was 135.1MB in the beginning and 132.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.45ms. Allocated memory is still 172.0MB. Free memory was 132.4MB in the beginning and 128.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1327.60ms. Allocated memory was 172.0MB in the beginning and 278.9MB in the end (delta: 107.0MB). Free memory was 128.2MB in the beginning and 202.2MB in the end (delta: -74.0MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8583.93ms. Allocated memory was 278.9MB in the beginning and 1.3GB in the end (delta: 985.7MB). Free memory was 202.2MB in the beginning and 792.0MB in the end (delta: -589.8MB). Peak memory consumption was 395.9MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 1.3GB. Free memory is still 790.9MB. 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=-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.4s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.5s 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.4s SatisfiabilityAnalysisTime, 1.2s 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-20 17:51:25,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-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-wip.dd.update-z3-fca748b-m [2024-11-20 17:51:27,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:51:27,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 17:51:27,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:51:27,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:51:27,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:51:27,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:51:27,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:51:27,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:51:27,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:51:27,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:51:27,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:51:27,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:51:27,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:51:27,704 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:51:27,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:51:27,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:51:27,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:51:27,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:51:27,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:51:27,709 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:51:27,710 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:51:27,710 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:51:27,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:51:27,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:51:27,710 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 17:51:27,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:51:27,711 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 17:51:27,711 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:51:27,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:51:27,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:51:27,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:51:27,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:51:27,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:51:27,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:51:27,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:51:27,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:51:27,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:51:27,712 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 17:51:27,712 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 17:51:27,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:51:27,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:51:27,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:51:27,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:51:27,715 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-20 17:51:27,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:51:28,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:51:28,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:51:28,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:51:28,022 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:51:28,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-20 17:51:29,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:51:29,577 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:51:29,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-20 17:51:29,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31f87565/d0c006ad75064260a61ffa550e8056d0/FLAGe03d919e0 [2024-11-20 17:51:29,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f31f87565/d0c006ad75064260a61ffa550e8056d0 [2024-11-20 17:51:29,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:51:29,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:51:29,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:51:29,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:51:29,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:51:29,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:51:29" (1/1) ... [2024-11-20 17:51:29,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1604c52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:29, skipping insertion in model container [2024-11-20 17:51:29,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:51:29" (1/1) ... [2024-11-20 17:51:30,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:51:30,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:51:30,426 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:51:30,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:51:30,530 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:51:30,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30 WrapperNode [2024-11-20 17:51:30,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:51:30,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:51:30,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:51:30,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:51:30,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,587 INFO L138 Inliner]: procedures = 250, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 263 [2024-11-20 17:51:30,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:51:30,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:51:30,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:51:30,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:51:30,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,622 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-20 17:51:30,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:51:30,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:51:30,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:51:30,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:51:30,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (1/1) ... [2024-11-20 17:51:30,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:51:30,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:51:30,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:51:30,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:51:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 17:51:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 17:51:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-20 17:51:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-20 17:51:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-20 17:51:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-20 17:51:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 17:51:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 17:51:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 17:51:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 17:51:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 17:51:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 17:51:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 17:51:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-20 17:51:30,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-20 17:51:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-20 17:51:30,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-20 17:51:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 17:51:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:51:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:51:30,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:51:30,723 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:51:30,930 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:51:30,932 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:51:31,219 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:51:31,219 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:51:32,336 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:51:32,336 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-20 17:51:32,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:51:32 BoogieIcfgContainer [2024-11-20 17:51:32,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:51:32,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:51:32,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:51:32,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:51:32,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:51:29" (1/3) ... [2024-11-20 17:51:32,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410c07e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:51:32, skipping insertion in model container [2024-11-20 17:51:32,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:51:30" (2/3) ... [2024-11-20 17:51:32,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410c07e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:51:32, skipping insertion in model container [2024-11-20 17:51:32,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:51:32" (3/3) ... [2024-11-20 17:51:32,344 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-11-20 17:51:32,357 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:51:32,357 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 17:51:32,357 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:51:32,402 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-20 17:51:32,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 100 flow [2024-11-20 17:51:32,506 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2024-11-20 17:51:32,506 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 17:51:32,509 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-20 17:51:32,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 43 transitions, 100 flow [2024-11-20 17:51:32,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 92 flow [2024-11-20 17:51:32,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:51:32,528 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;@319e3167, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:51:32,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-20 17:51:32,569 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:51:32,570 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2024-11-20 17:51:32,570 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 17:51:32,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:32,571 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:51:32,571 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-20 17:51:32,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1752607071, now seen corresponding path program 1 times [2024-11-20 17:51:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:51:32,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564490238] [2024-11-20 17:51:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:32,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:32,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:51:32,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:51:32,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 17:51:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:33,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:51:33,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:51:33,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:51:33,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:51:33,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564490238] [2024-11-20 17:51:33,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564490238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:51:33,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:51:33,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:51:33,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192522705] [2024-11-20 17:51:33,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:51:33,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:51:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:51:33,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:51:33,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:51:33,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-20 17:51:33,210 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-20 17:51:33,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:33,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-20 17:51:33,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:33,398 INFO L124 PetriNetUnfolderBase]: 454/794 cut-off events. [2024-11-20 17:51:33,398 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-20 17:51:33,400 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-20 17:51:33,405 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 39 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-11-20 17:51:33,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 205 flow [2024-11-20 17:51:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:51:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:51:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-20 17:51:33,414 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2024-11-20 17:51:33,416 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 92 flow. Second operand 3 states and 89 transitions. [2024-11-20 17:51:33,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 205 flow [2024-11-20 17:51:33,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:51:33,420 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 90 flow [2024-11-20 17:51:33,422 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-20 17:51:33,424 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-20 17:51:33,425 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 90 flow [2024-11-20 17:51:33,425 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-20 17:51:33,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:33,425 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:51:33,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 17:51:33,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:33,626 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-20 17:51:33,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:33,627 INFO L85 PathProgramCache]: Analyzing trace with hash -346846753, now seen corresponding path program 1 times [2024-11-20 17:51:33,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:51:33,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921072776] [2024-11-20 17:51:33,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:33,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:33,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:51:33,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:51:33,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 17:51:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:34,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:51:34,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:34,023 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-20 17:51:34,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:51:34,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:51:34,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921072776] [2024-11-20 17:51:34,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921072776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:51:34,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:51:34,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:51:34,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629369110] [2024-11-20 17:51:34,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:51:34,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:51:34,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:51:34,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:51:34,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:51:34,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-20 17:51:34,028 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-20 17:51:34,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:34,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-20 17:51:34,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:34,244 INFO L124 PetriNetUnfolderBase]: 742/1327 cut-off events. [2024-11-20 17:51:34,244 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2024-11-20 17:51:34,246 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-20 17:51:34,250 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 40 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-11-20 17:51:34,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 219 flow [2024-11-20 17:51:34,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:51:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:51:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-20 17:51:34,251 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-20 17:51:34,251 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 90 flow. Second operand 3 states and 86 transitions. [2024-11-20 17:51:34,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 219 flow [2024-11-20 17:51:34,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:34,253 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 100 flow [2024-11-20 17:51:34,253 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-20 17:51:34,254 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2024-11-20 17:51:34,254 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 100 flow [2024-11-20 17:51:34,254 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-20 17:51:34,254 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:34,254 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-20 17:51:34,259 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 (3)] Forceful destruction successful, exit code 0 [2024-11-20 17:51:34,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:34,455 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-20 17:51:34,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash 514794997, now seen corresponding path program 1 times [2024-11-20 17:51:34,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:51:34,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075455599] [2024-11-20 17:51:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:34,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:34,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:51:34,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:51:34,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 17:51:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:34,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:51:34,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:34,929 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-20 17:51:34,962 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-20 17:51:34,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:51:34,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:51:34,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075455599] [2024-11-20 17:51:34,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075455599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:51:34,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:51:34,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:51:34,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69457026] [2024-11-20 17:51:34,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:51:34,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:51:34,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:51:34,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:51:34,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:51:34,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-11-20 17:51:34,973 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-20 17:51:34,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:34,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-11-20 17:51:34,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:35,174 INFO L124 PetriNetUnfolderBase]: 428/905 cut-off events. [2024-11-20 17:51:35,174 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-11-20 17:51:35,175 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-20 17:51:35,178 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 30 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2024-11-20 17:51:35,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2024-11-20 17:51:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:51:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:51:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-20 17:51:35,179 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2024-11-20 17:51:35,179 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 100 flow. Second operand 3 states and 83 transitions. [2024-11-20 17:51:35,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2024-11-20 17:51:35,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:35,181 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 114 flow [2024-11-20 17:51:35,181 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-20 17:51:35,182 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-11-20 17:51:35,182 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 114 flow [2024-11-20 17:51:35,182 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-20 17:51:35,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:35,182 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-20 17:51:35,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 17:51:35,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:35,383 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-20 17:51:35,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:35,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2014236483, now seen corresponding path program 2 times [2024-11-20 17:51:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:51:35,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055736262] [2024-11-20 17:51:35,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:51:35,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:35,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:51:35,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:51:35,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 17:51:35,825 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:51:35,825 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:51:35,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:51:35,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:35,840 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-20 17:51:35,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:51:35,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:51:35,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055736262] [2024-11-20 17:51:35,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055736262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:51:35,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:51:35,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:51:35,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620132120] [2024-11-20 17:51:35,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:51:35,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:51:35,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:51:35,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:51:35,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:51:35,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-20 17:51:35,846 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-20 17:51:35,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:35,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-20 17:51:35,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:35,994 INFO L124 PetriNetUnfolderBase]: 462/946 cut-off events. [2024-11-20 17:51:35,994 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2024-11-20 17:51:35,995 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-20 17:51:35,998 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 36 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2024-11-20 17:51:35,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 225 flow [2024-11-20 17:51:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:51:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:51:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-11-20 17:51:35,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5968992248062015 [2024-11-20 17:51:35,999 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 114 flow. Second operand 3 states and 77 transitions. [2024-11-20 17:51:35,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 225 flow [2024-11-20 17:51:36,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:36,002 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 106 flow [2024-11-20 17:51:36,002 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-20 17:51:36,002 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-11-20 17:51:36,002 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 106 flow [2024-11-20 17:51:36,003 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-20 17:51:36,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:36,003 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-20 17:51:36,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 17:51:36,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:36,208 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-20 17:51:36,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1739470004, now seen corresponding path program 1 times [2024-11-20 17:51:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:51:36,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924328810] [2024-11-20 17:51:36,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:36,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:36,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:51:36,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:51:36,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 17:51:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:36,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:51:36,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:36,688 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-20 17:51:36,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:51:36,739 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-20 17:51:36,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:51:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924328810] [2024-11-20 17:51:36,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924328810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:51:36,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:51:36,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-20 17:51:36,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803855830] [2024-11-20 17:51:36,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:51:36,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:51:36,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:51:36,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:51:36,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:51:36,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-20 17:51:36,745 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-20 17:51:36,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:36,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-20 17:51:36,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:37,128 INFO L124 PetriNetUnfolderBase]: 809/1576 cut-off events. [2024-11-20 17:51:37,128 INFO L125 PetriNetUnfolderBase]: For 357/357 co-relation queries the response was YES. [2024-11-20 17:51:37,130 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-20 17:51:37,136 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 72 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2024-11-20 17:51:37,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 88 transitions, 415 flow [2024-11-20 17:51:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:51:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:51:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-20 17:51:37,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2024-11-20 17:51:37,137 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 106 flow. Second operand 5 states and 145 transitions. [2024-11-20 17:51:37,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 88 transitions, 415 flow [2024-11-20 17:51:37,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 88 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:37,139 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 135 flow [2024-11-20 17:51:37,140 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-20 17:51:37,140 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2024-11-20 17:51:37,140 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 135 flow [2024-11-20 17:51:37,140 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-20 17:51:37,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:37,141 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-20 17:51:37,145 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-20 17:51:37,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:37,342 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-20 17:51:37,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:37,343 INFO L85 PathProgramCache]: Analyzing trace with hash 934677356, now seen corresponding path program 2 times [2024-11-20 17:51:37,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:51:37,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922837976] [2024-11-20 17:51:37,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:51:37,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:37,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:51:37,345 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:51:37,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 17:51:37,705 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:51:37,706 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:51:37,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:51:37,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:37,755 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-20 17:51:37,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:51:37,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:51:37,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922837976] [2024-11-20 17:51:37,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922837976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:51:37,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:51:37,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:51:37,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520530412] [2024-11-20 17:51:37,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:51:37,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:51:37,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:51:37,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:51:37,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:51:37,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-20 17:51:37,758 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-20 17:51:37,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:37,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-20 17:51:37,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:37,873 INFO L124 PetriNetUnfolderBase]: 686/1396 cut-off events. [2024-11-20 17:51:37,873 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2024-11-20 17:51:37,876 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-20 17:51:37,880 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 26 selfloop transitions, 1 changer transitions 2/39 dead transitions. [2024-11-20 17:51:37,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 187 flow [2024-11-20 17:51:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:51:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:51:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-20 17:51:37,881 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2024-11-20 17:51:37,881 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 135 flow. Second operand 3 states and 67 transitions. [2024-11-20 17:51:37,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 187 flow [2024-11-20 17:51:37,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 181 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:37,883 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 125 flow [2024-11-20 17:51:37,883 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-20 17:51:37,884 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2024-11-20 17:51:37,884 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 125 flow [2024-11-20 17:51:37,884 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-20 17:51:37,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:37,885 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-20 17:51:37,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 17:51:38,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:38,086 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-20 17:51:38,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:38,086 INFO L85 PathProgramCache]: Analyzing trace with hash 496076111, now seen corresponding path program 1 times [2024-11-20 17:51:38,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:51:38,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24258066] [2024-11-20 17:51:38,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:51:38,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:38,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:51:38,089 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:51:38,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 17:51:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:51:38,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:51:38,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:38,502 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-20 17:51:38,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:51:38,533 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-20 17:51:38,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:51:38,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24258066] [2024-11-20 17:51:38,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24258066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:51:38,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:51:38,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-20 17:51:38,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037344698] [2024-11-20 17:51:38,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:51:38,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:51:38,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:51:38,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:51:38,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:51:38,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-20 17:51:38,538 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-20 17:51:38,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:38,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-20 17:51:38,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:38,897 INFO L124 PetriNetUnfolderBase]: 1159/2258 cut-off events. [2024-11-20 17:51:38,897 INFO L125 PetriNetUnfolderBase]: For 964/964 co-relation queries the response was YES. [2024-11-20 17:51:38,901 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-20 17:51:38,909 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 73 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2024-11-20 17:51:38,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 87 transitions, 472 flow [2024-11-20 17:51:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:51:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:51:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-11-20 17:51:38,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6604651162790698 [2024-11-20 17:51:38,911 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 125 flow. Second operand 5 states and 142 transitions. [2024-11-20 17:51:38,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 87 transitions, 472 flow [2024-11-20 17:51:38,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:38,914 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 154 flow [2024-11-20 17:51:38,914 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-20 17:51:38,915 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2024-11-20 17:51:38,915 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 154 flow [2024-11-20 17:51:38,915 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-20 17:51:38,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:38,915 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-20 17:51:38,920 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 (8)] Forceful destruction successful, exit code 0 [2024-11-20 17:51:39,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:39,120 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-20 17:51:39,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash 331843383, now seen corresponding path program 2 times [2024-11-20 17:51:39,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:51:39,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502982552] [2024-11-20 17:51:39,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:51:39,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:39,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:51:39,124 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:51:39,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 17:51:39,560 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 17:51:39,560 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:51:39,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:51:39,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:51:39,599 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-20 17:51:39,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:51:39,628 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-20 17:51:39,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:51:39,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502982552] [2024-11-20 17:51:39,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502982552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:51:39,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:51:39,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2024-11-20 17:51:39,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247139789] [2024-11-20 17:51:39,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:51:39,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:51:39,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:51:39,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:51:39,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:51:39,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-11-20 17:51:39,633 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-20 17:51:39,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:51:39,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-11-20 17:51:39,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:51:39,798 INFO L124 PetriNetUnfolderBase]: 448/983 cut-off events. [2024-11-20 17:51:39,798 INFO L125 PetriNetUnfolderBase]: For 902/904 co-relation queries the response was YES. [2024-11-20 17:51:39,799 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-20 17:51:39,802 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 46 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-11-20 17:51:39,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 344 flow [2024-11-20 17:51:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:51:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:51:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-20 17:51:39,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.563953488372093 [2024-11-20 17:51:39,803 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 154 flow. Second operand 4 states and 97 transitions. [2024-11-20 17:51:39,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 344 flow [2024-11-20 17:51:39,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 332 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-20 17:51:39,805 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 163 flow [2024-11-20 17:51:39,805 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-20 17:51:39,805 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2024-11-20 17:51:39,805 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 163 flow [2024-11-20 17:51:39,806 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-20 17:51:39,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:51:39,806 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-20 17:51:39,812 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-20 17:51:40,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:40,011 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-20 17:51:40,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:51:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash -887040361, now seen corresponding path program 3 times [2024-11-20 17:51:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:51:40,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096552773] [2024-11-20 17:51:40,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 17:51:40,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:40,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:51:40,015 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:51:40,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 17:51:40,405 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-20 17:51:40,405 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-20 17:51:40,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:51:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:51:40,558 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 17:51:40,559 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:51:40,560 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-20 17:51:40,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-20 17:51:40,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-20 17:51:40,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-20 17:51:40,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-20 17:51:40,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:51:40,762 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1] [2024-11-20 17:51:40,820 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:51:40,822 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:51:40,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:51:40 BasicIcfg [2024-11-20 17:51:40,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:51:40,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:51:40,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:51:40,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:51:40,827 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:51:32" (3/4) ... [2024-11-20 17:51:40,829 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:51:40,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:51:40,831 INFO L158 Benchmark]: Toolchain (without parser) took 10877.58ms. Allocated memory was 69.2MB in the beginning and 874.5MB in the end (delta: 805.3MB). Free memory was 43.8MB in the beginning and 617.5MB in the end (delta: -573.8MB). Peak memory consumption was 231.8MB. Max. memory is 16.1GB. [2024-11-20 17:51:40,831 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 69.2MB. Free memory was 49.2MB in the beginning and 49.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:51:40,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.28ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 43.5MB in the beginning and 50.8MB in the end (delta: -7.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 17:51:40,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.89ms. Allocated memory is still 90.2MB. Free memory was 50.8MB in the beginning and 47.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 17:51:40,831 INFO L158 Benchmark]: Boogie Preprocessor took 64.21ms. Allocated memory is still 90.2MB. Free memory was 47.5MB in the beginning and 43.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 17:51:40,832 INFO L158 Benchmark]: RCFGBuilder took 1684.58ms. Allocated memory was 90.2MB in the beginning and 157.3MB in the end (delta: 67.1MB). Free memory was 43.3MB in the beginning and 69.6MB in the end (delta: -26.3MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2024-11-20 17:51:40,835 INFO L158 Benchmark]: TraceAbstraction took 8488.07ms. Allocated memory was 157.3MB in the beginning and 874.5MB in the end (delta: 717.2MB). Free memory was 68.6MB in the beginning and 617.5MB in the end (delta: -549.0MB). Peak memory consumption was 169.3MB. Max. memory is 16.1GB. [2024-11-20 17:51:40,835 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 874.5MB. Free memory is still 617.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:51:40,836 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.03ms. Allocated memory is still 69.2MB. Free memory was 49.2MB in the beginning and 49.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.28ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 43.5MB in the beginning and 50.8MB in the end (delta: -7.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.89ms. Allocated memory is still 90.2MB. Free memory was 50.8MB in the beginning and 47.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.21ms. Allocated memory is still 90.2MB. Free memory was 47.5MB in the beginning and 43.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1684.58ms. Allocated memory was 90.2MB in the beginning and 157.3MB in the end (delta: 67.1MB). Free memory was 43.3MB in the beginning and 69.6MB in the end (delta: -26.3MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8488.07ms. Allocated memory was 157.3MB in the beginning and 874.5MB in the end (delta: 717.2MB). Free memory was 68.6MB in the beginning and 617.5MB in the end (delta: -549.0MB). Peak memory consumption was 169.3MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 874.5MB. Free memory is still 617.5MB. 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.3s, 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.2s SsaConstructionTime, 0.5s 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-20 17:51:40,857 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