./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/circular_buffer_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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:43:24,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:43:24,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:43:24,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:43:24,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:43:24,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:43:24,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:43:24,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:43:24,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:43:24,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:43:24,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:43:24,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:43:24,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:43:24,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:43:24,336 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:43:24,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:43:24,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:43:24,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:43:24,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:43:24,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:43:24,343 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:43:24,343 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:43:24,343 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:43:24,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:43:24,344 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:43:24,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:43:24,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:43:24,345 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:43:24,345 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:43:24,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:43:24,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:43:24,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:43:24,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:43:24,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:43:24,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:43:24,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:43:24,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:43:24,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:43:24,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:43:24,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:43:24,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:43:24,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:43:24,350 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-11-17 03:43:24,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:43:24,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:43:24,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:43:24,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:43:24,619 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:43:24,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-17 03:43:26,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:43:26,277 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:43:26,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-17 03:43:26,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba1ecdb9/2d9ca0ce66664046bade25de79f8b17b/FLAG610e5fe39 [2024-11-17 03:43:26,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba1ecdb9/2d9ca0ce66664046bade25de79f8b17b [2024-11-17 03:43:26,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:43:26,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:43:26,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:43:26,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:43:26,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:43:26,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:26,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aabbfd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26, skipping insertion in model container [2024-11-17 03:43:26,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:26,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:43:26,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:43:26,776 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:43:26,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:43:26,886 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:43:26,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26 WrapperNode [2024-11-17 03:43:26,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:43:26,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:43:26,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:43:26,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:43:26,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:26,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:26,937 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 140 [2024-11-17 03:43:26,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:43:26,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:43:26,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:43:26,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:43:26,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:26,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:26,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:26,987 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2024-11-17 03:43:26,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:26,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:27,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:27,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:27,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:27,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:27,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:43:27,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:43:27,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:43:27,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:43:27,020 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (1/1) ... [2024-11-17 03:43:27,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:43:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:43:27,065 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-17 03:43:27,070 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-17 03:43:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 03:43:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 03:43:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 03:43:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-17 03:43:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-17 03:43:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-17 03:43:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-17 03:43:27,127 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-17 03:43:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 03:43:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 03:43:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 03:43:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-17 03:43:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-17 03:43:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:43:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 03:43:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 03:43:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 03:43:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-17 03:43:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:43:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 03:43:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 03:43:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-17 03:43:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-17 03:43:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:43:27,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:43:27,134 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:43:27,323 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:43:27,325 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:43:27,647 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem2#1; [2024-11-17 03:43:27,648 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:43:27,648 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:43:27,832 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:43:27,832 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:43:27,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:43:27 BoogieIcfgContainer [2024-11-17 03:43:27,833 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:43:27,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:43:27,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:43:27,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:43:27,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:43:26" (1/3) ... [2024-11-17 03:43:27,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2feae872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:43:27, skipping insertion in model container [2024-11-17 03:43:27,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:26" (2/3) ... [2024-11-17 03:43:27,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2feae872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:43:27, skipping insertion in model container [2024-11-17 03:43:27,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:43:27" (3/3) ... [2024-11-17 03:43:27,847 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-17 03:43:27,864 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:43:27,865 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-17 03:43:27,865 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:43:27,938 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-17 03:43:27,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 64 transitions, 142 flow [2024-11-17 03:43:28,012 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2024-11-17 03:43:28,013 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:43:28,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 62 events. 12/62 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 162 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-11-17 03:43:28,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 64 transitions, 142 flow [2024-11-17 03:43:28,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 61 transitions, 134 flow [2024-11-17 03:43:28,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:43:28,045 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;@1d5badc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:43:28,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-17 03:43:28,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:43:28,058 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2024-11-17 03:43:28,058 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:43:28,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:28,059 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:28,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:28,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:28,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1563918970, now seen corresponding path program 1 times [2024-11-17 03:43:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043181779] [2024-11-17 03:43:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:28,457 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-17 03:43:28,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:28,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043181779] [2024-11-17 03:43:28,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043181779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:28,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:28,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:43:28,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612772620] [2024-11-17 03:43:28,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:28,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:28,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:28,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:28,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:28,523 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-11-17 03:43:28,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:43:28,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:28,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-11-17 03:43:28,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:28,751 INFO L124 PetriNetUnfolderBase]: 445/847 cut-off events. [2024-11-17 03:43:28,751 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-17 03:43:28,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 847 events. 445/847 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4587 event pairs, 330 based on Foata normal form. 136/880 useless extension candidates. Maximal degree in co-relation 1514. Up to 711 conditions per place. [2024-11-17 03:43:28,768 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 30 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2024-11-17 03:43:28,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 176 flow [2024-11-17 03:43:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-11-17 03:43:28,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-11-17 03:43:28,786 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 134 flow. Second operand 3 states and 105 transitions. [2024-11-17 03:43:28,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 176 flow [2024-11-17 03:43:28,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:43:28,816 INFO L231 Difference]: Finished difference. Result has 50 places, 51 transitions, 108 flow [2024-11-17 03:43:28,820 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=51} [2024-11-17 03:43:28,824 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2024-11-17 03:43:28,824 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 51 transitions, 108 flow [2024-11-17 03:43:28,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:43:28,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:28,825 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:28,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:43:28,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:28,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1563918969, now seen corresponding path program 1 times [2024-11-17 03:43:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:28,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957513227] [2024-11-17 03:43:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:28,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:29,136 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-17 03:43:29,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:29,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957513227] [2024-11-17 03:43:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957513227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:29,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:43:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885806831] [2024-11-17 03:43:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:29,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:29,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:29,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:29,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:29,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:29,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-17 03:43:29,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:29,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:29,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:29,394 INFO L124 PetriNetUnfolderBase]: 788/1535 cut-off events. [2024-11-17 03:43:29,395 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-17 03:43:29,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1535 events. 788/1535 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8644 event pairs, 263 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 2766. Up to 698 conditions per place. [2024-11-17 03:43:29,410 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 55 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-11-17 03:43:29,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 275 flow [2024-11-17 03:43:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-11-17 03:43:29,413 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-17 03:43:29,414 INFO L175 Difference]: Start difference. First operand has 50 places, 51 transitions, 108 flow. Second operand 3 states and 128 transitions. [2024-11-17 03:43:29,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 275 flow [2024-11-17 03:43:29,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:43:29,416 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 121 flow [2024-11-17 03:43:29,417 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2024-11-17 03:43:29,418 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2024-11-17 03:43:29,418 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 121 flow [2024-11-17 03:43:29,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-17 03:43:29,418 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:29,418 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:29,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:43:29,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:29,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1095619822, now seen corresponding path program 1 times [2024-11-17 03:43:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:29,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887356488] [2024-11-17 03:43:29,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:29,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:29,620 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-17 03:43:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887356488] [2024-11-17 03:43:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887356488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:29,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:29,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:43:29,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430214832] [2024-11-17 03:43:29,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:29,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:43:29,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:29,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:43:29,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:43:29,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-11-17 03:43:29,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-17 03:43:29,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:29,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-11-17 03:43:29,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:29,802 INFO L124 PetriNetUnfolderBase]: 831/1536 cut-off events. [2024-11-17 03:43:29,802 INFO L125 PetriNetUnfolderBase]: For 50/60 co-relation queries the response was YES. [2024-11-17 03:43:29,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2972 conditions, 1536 events. 831/1536 cut-off events. For 50/60 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8328 event pairs, 619 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2964. Up to 1300 conditions per place. [2024-11-17 03:43:29,811 INFO L140 encePairwiseOnDemand]: 62/64 looper letters, 32 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2024-11-17 03:43:29,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 181 flow [2024-11-17 03:43:29,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-17 03:43:29,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515625 [2024-11-17 03:43:29,813 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 121 flow. Second operand 3 states and 99 transitions. [2024-11-17 03:43:29,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 181 flow [2024-11-17 03:43:29,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:43:29,815 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 115 flow [2024-11-17 03:43:29,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-11-17 03:43:29,816 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2024-11-17 03:43:29,817 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 115 flow [2024-11-17 03:43:29,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-17 03:43:29,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:29,817 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:29,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:43:29,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:29,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1646228857, now seen corresponding path program 1 times [2024-11-17 03:43:29,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:29,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399090076] [2024-11-17 03:43:29,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:29,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:29,891 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-17 03:43:29,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:29,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399090076] [2024-11-17 03:43:29,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399090076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:29,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:29,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:43:29,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113214573] [2024-11-17 03:43:29,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:29,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:29,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:29,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:29,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:29,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-17 03:43:29,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-17 03:43:29,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:29,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-17 03:43:29,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:30,128 INFO L124 PetriNetUnfolderBase]: 995/1982 cut-off events. [2024-11-17 03:43:30,129 INFO L125 PetriNetUnfolderBase]: For 89/105 co-relation queries the response was YES. [2024-11-17 03:43:30,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 1982 events. 995/1982 cut-off events. For 89/105 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 11552 event pairs, 358 based on Foata normal form. 26/1872 useless extension candidates. Maximal degree in co-relation 3648. Up to 1047 conditions per place. [2024-11-17 03:43:30,143 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 48 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2024-11-17 03:43:30,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 264 flow [2024-11-17 03:43:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-11-17 03:43:30,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2024-11-17 03:43:30,148 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 115 flow. Second operand 3 states and 122 transitions. [2024-11-17 03:43:30,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 264 flow [2024-11-17 03:43:30,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:43:30,151 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 129 flow [2024-11-17 03:43:30,151 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2024-11-17 03:43:30,152 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2024-11-17 03:43:30,153 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 129 flow [2024-11-17 03:43:30,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-17 03:43:30,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:30,153 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:30,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:43:30,154 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:30,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash -595935632, now seen corresponding path program 1 times [2024-11-17 03:43:30,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:30,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968714637] [2024-11-17 03:43:30,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:30,195 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-17 03:43:30,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:30,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968714637] [2024-11-17 03:43:30,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968714637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:30,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:30,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:43:30,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084646787] [2024-11-17 03:43:30,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:30,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:30,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:30,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:30,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:30,202 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:30,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-17 03:43:30,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:30,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:30,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:30,543 INFO L124 PetriNetUnfolderBase]: 1363/2578 cut-off events. [2024-11-17 03:43:30,543 INFO L125 PetriNetUnfolderBase]: For 291/306 co-relation queries the response was YES. [2024-11-17 03:43:30,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5179 conditions, 2578 events. 1363/2578 cut-off events. For 291/306 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 15938 event pairs, 586 based on Foata normal form. 12/2313 useless extension candidates. Maximal degree in co-relation 5168. Up to 1735 conditions per place. [2024-11-17 03:43:30,560 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 54 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-11-17 03:43:30,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 300 flow [2024-11-17 03:43:30,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-11-17 03:43:30,561 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-11-17 03:43:30,562 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 129 flow. Second operand 3 states and 124 transitions. [2024-11-17 03:43:30,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 300 flow [2024-11-17 03:43:30,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 295 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:43:30,564 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 138 flow [2024-11-17 03:43:30,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2024-11-17 03:43:30,565 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2024-11-17 03:43:30,565 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 138 flow [2024-11-17 03:43:30,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-17 03:43:30,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:30,566 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:30,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:43:30,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:30,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash 698723903, now seen corresponding path program 1 times [2024-11-17 03:43:30,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:30,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56285911] [2024-11-17 03:43:30,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:30,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:43:30,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:30,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56285911] [2024-11-17 03:43:30,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56285911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:30,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:30,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:43:30,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969251890] [2024-11-17 03:43:30,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:30,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:30,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:30,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:30,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:30,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-17 03:43:30,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-17 03:43:30,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:30,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-17 03:43:30,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:30,902 INFO L124 PetriNetUnfolderBase]: 1020/2099 cut-off events. [2024-11-17 03:43:30,902 INFO L125 PetriNetUnfolderBase]: For 204/210 co-relation queries the response was YES. [2024-11-17 03:43:30,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4200 conditions, 2099 events. 1020/2099 cut-off events. For 204/210 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 13010 event pairs, 428 based on Foata normal form. 50/2051 useless extension candidates. Maximal degree in co-relation 4188. Up to 908 conditions per place. [2024-11-17 03:43:30,915 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 46 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-17 03:43:30,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 270 flow [2024-11-17 03:43:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-11-17 03:43:30,917 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2024-11-17 03:43:30,917 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 138 flow. Second operand 3 states and 118 transitions. [2024-11-17 03:43:30,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 270 flow [2024-11-17 03:43:30,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:43:30,920 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 137 flow [2024-11-17 03:43:30,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-11-17 03:43:30,921 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-11-17 03:43:30,921 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 137 flow [2024-11-17 03:43:30,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-17 03:43:30,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:30,922 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] [2024-11-17 03:43:30,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:43:30,922 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:30,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:30,923 INFO L85 PathProgramCache]: Analyzing trace with hash -393573783, now seen corresponding path program 1 times [2024-11-17 03:43:30,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:30,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939050566] [2024-11-17 03:43:30,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:31,054 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-17 03:43:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:31,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939050566] [2024-11-17 03:43:31,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939050566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:31,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:43:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563200936] [2024-11-17 03:43:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:31,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:31,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:31,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:31,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:31,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-17 03:43:31,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 03:43:31,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:31,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-17 03:43:31,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:31,229 INFO L124 PetriNetUnfolderBase]: 689/1578 cut-off events. [2024-11-17 03:43:31,230 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2024-11-17 03:43:31,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3146 conditions, 1578 events. 689/1578 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9394 event pairs, 221 based on Foata normal form. 66/1583 useless extension candidates. Maximal degree in co-relation 3134. Up to 692 conditions per place. [2024-11-17 03:43:31,239 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 39 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2024-11-17 03:43:31,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 253 flow [2024-11-17 03:43:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-17 03:43:31,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-11-17 03:43:31,241 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 137 flow. Second operand 3 states and 114 transitions. [2024-11-17 03:43:31,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 253 flow [2024-11-17 03:43:31,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:43:31,244 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 141 flow [2024-11-17 03:43:31,244 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-11-17 03:43:31,245 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-11-17 03:43:31,245 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 141 flow [2024-11-17 03:43:31,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 03:43:31,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:31,245 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:31,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:43:31,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:31,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:31,246 INFO L85 PathProgramCache]: Analyzing trace with hash 897238367, now seen corresponding path program 1 times [2024-11-17 03:43:31,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:31,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854307968] [2024-11-17 03:43:31,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:31,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:31,294 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-17 03:43:31,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:31,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854307968] [2024-11-17 03:43:31,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854307968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:31,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:31,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:43:31,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993866018] [2024-11-17 03:43:31,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:31,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:31,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:31,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:31,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:31,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:31,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 03:43:31,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:31,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:31,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:31,535 INFO L124 PetriNetUnfolderBase]: 1175/2646 cut-off events. [2024-11-17 03:43:31,535 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2024-11-17 03:43:31,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5565 conditions, 2646 events. 1175/2646 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 17930 event pairs, 596 based on Foata normal form. 59/2604 useless extension candidates. Maximal degree in co-relation 5553. Up to 1358 conditions per place. [2024-11-17 03:43:31,550 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 55 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2024-11-17 03:43:31,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 332 flow [2024-11-17 03:43:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-11-17 03:43:31,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.640625 [2024-11-17 03:43:31,552 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 141 flow. Second operand 3 states and 123 transitions. [2024-11-17 03:43:31,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 332 flow [2024-11-17 03:43:31,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:43:31,555 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 149 flow [2024-11-17 03:43:31,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-11-17 03:43:31,556 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 1 predicate places. [2024-11-17 03:43:31,556 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 149 flow [2024-11-17 03:43:31,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 03:43:31,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:31,557 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] [2024-11-17 03:43:31,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:43:31,557 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:31,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1817468875, now seen corresponding path program 1 times [2024-11-17 03:43:31,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:31,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267061077] [2024-11-17 03:43:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:31,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:31,816 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-17 03:43:31,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:31,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267061077] [2024-11-17 03:43:31,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267061077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:31,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:31,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:43:31,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071561481] [2024-11-17 03:43:31,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:31,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:43:31,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:31,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:43:31,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:43:31,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:31,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-17 03:43:31,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:31,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:31,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:32,209 INFO L124 PetriNetUnfolderBase]: 1599/3624 cut-off events. [2024-11-17 03:43:32,210 INFO L125 PetriNetUnfolderBase]: For 1030/1038 co-relation queries the response was YES. [2024-11-17 03:43:32,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7787 conditions, 3624 events. 1599/3624 cut-off events. For 1030/1038 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 23854 event pairs, 914 based on Foata normal form. 0/3496 useless extension candidates. Maximal degree in co-relation 7773. Up to 1754 conditions per place. [2024-11-17 03:43:32,229 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 80 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2024-11-17 03:43:32,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 100 transitions, 462 flow [2024-11-17 03:43:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:43:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:43:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2024-11-17 03:43:32,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.66796875 [2024-11-17 03:43:32,231 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 149 flow. Second operand 4 states and 171 transitions. [2024-11-17 03:43:32,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 100 transitions, 462 flow [2024-11-17 03:43:32,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 459 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:43:32,235 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 167 flow [2024-11-17 03:43:32,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-11-17 03:43:32,236 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2024-11-17 03:43:32,236 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 167 flow [2024-11-17 03:43:32,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-17 03:43:32,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:32,237 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] [2024-11-17 03:43:32,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:43:32,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:32,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1801233563, now seen corresponding path program 1 times [2024-11-17 03:43:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:32,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756254505] [2024-11-17 03:43:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:32,387 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-17 03:43:32,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:32,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756254505] [2024-11-17 03:43:32,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756254505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:32,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:32,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:43:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856099694] [2024-11-17 03:43:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:32,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:32,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:32,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-17 03:43:32,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-17 03:43:32,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:32,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-17 03:43:32,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:32,671 INFO L124 PetriNetUnfolderBase]: 1237/2850 cut-off events. [2024-11-17 03:43:32,672 INFO L125 PetriNetUnfolderBase]: For 813/819 co-relation queries the response was YES. [2024-11-17 03:43:32,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 2850 events. 1237/2850 cut-off events. For 813/819 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 17635 event pairs, 516 based on Foata normal form. 28/2796 useless extension candidates. Maximal degree in co-relation 6037. Up to 1673 conditions per place. [2024-11-17 03:43:32,684 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 51 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-17 03:43:32,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 328 flow [2024-11-17 03:43:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-11-17 03:43:32,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-17 03:43:32,686 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 167 flow. Second operand 3 states and 120 transitions. [2024-11-17 03:43:32,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 328 flow [2024-11-17 03:43:32,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 322 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-17 03:43:32,689 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 169 flow [2024-11-17 03:43:32,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-11-17 03:43:32,689 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-11-17 03:43:32,690 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 169 flow [2024-11-17 03:43:32,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-17 03:43:32,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:32,690 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-17 03:43:32,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:43:32,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:32,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:32,691 INFO L85 PathProgramCache]: Analyzing trace with hash 268498982, now seen corresponding path program 1 times [2024-11-17 03:43:32,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:32,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856007195] [2024-11-17 03:43:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:32,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 03:43:32,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1070599458] [2024-11-17 03:43:32,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:32,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:43:32,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:43:32,722 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-17 03:43:32,725 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-17 03:43:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:32,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 03:43:32,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:33,087 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-17 03:43:33,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:33,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:33,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856007195] [2024-11-17 03:43:33,089 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-17 03:43:33,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070599458] [2024-11-17 03:43:33,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070599458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:33,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:33,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:43:33,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868758919] [2024-11-17 03:43:33,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:33,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:43:33,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:33,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:43:33,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:43:33,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-17 03:43:33,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-17 03:43:33,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:33,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-17 03:43:33,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:33,372 INFO L124 PetriNetUnfolderBase]: 1010/2390 cut-off events. [2024-11-17 03:43:33,374 INFO L125 PetriNetUnfolderBase]: For 705/707 co-relation queries the response was YES. [2024-11-17 03:43:33,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5099 conditions, 2390 events. 1010/2390 cut-off events. For 705/707 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 13963 event pairs, 348 based on Foata normal form. 18/2354 useless extension candidates. Maximal degree in co-relation 5080. Up to 908 conditions per place. [2024-11-17 03:43:33,388 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 66 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2024-11-17 03:43:33,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 412 flow [2024-11-17 03:43:33,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:43:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:43:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-11-17 03:43:33,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.62109375 [2024-11-17 03:43:33,390 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 169 flow. Second operand 4 states and 159 transitions. [2024-11-17 03:43:33,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 412 flow [2024-11-17 03:43:33,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:43:33,395 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 175 flow [2024-11-17 03:43:33,395 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2024-11-17 03:43:33,396 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2024-11-17 03:43:33,396 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 175 flow [2024-11-17 03:43:33,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-17 03:43:33,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:33,397 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:33,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 03:43:33,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-17 03:43:33,598 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:33,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash -296080977, now seen corresponding path program 1 times [2024-11-17 03:43:33,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:33,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057229645] [2024-11-17 03:43:33,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:34,415 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-17 03:43:34,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:34,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057229645] [2024-11-17 03:43:34,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057229645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:34,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:34,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 03:43:34,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442877771] [2024-11-17 03:43:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:34,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:43:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:34,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:43:34,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:43:34,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-11-17 03:43:34,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 175 flow. Second operand has 11 states, 11 states have (on average 23.636363636363637) internal successors, (260), 11 states have internal predecessors, (260), 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-17 03:43:34,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:34,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-11-17 03:43:34,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:35,486 INFO L124 PetriNetUnfolderBase]: 1557/3340 cut-off events. [2024-11-17 03:43:35,486 INFO L125 PetriNetUnfolderBase]: For 1384/1392 co-relation queries the response was YES. [2024-11-17 03:43:35,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7530 conditions, 3340 events. 1557/3340 cut-off events. For 1384/1392 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 19902 event pairs, 568 based on Foata normal form. 0/3278 useless extension candidates. Maximal degree in co-relation 7510. Up to 1800 conditions per place. [2024-11-17 03:43:35,502 INFO L140 encePairwiseOnDemand]: 51/64 looper letters, 118 selfloop transitions, 17 changer transitions 0/151 dead transitions. [2024-11-17 03:43:35,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 151 transitions, 770 flow [2024-11-17 03:43:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:43:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:43:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 389 transitions. [2024-11-17 03:43:35,505 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5065104166666666 [2024-11-17 03:43:35,505 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 175 flow. Second operand 12 states and 389 transitions. [2024-11-17 03:43:35,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 151 transitions, 770 flow [2024-11-17 03:43:35,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 151 transitions, 760 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-17 03:43:35,511 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 309 flow [2024-11-17 03:43:35,511 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=309, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2024-11-17 03:43:35,511 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 25 predicate places. [2024-11-17 03:43:35,511 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 309 flow [2024-11-17 03:43:35,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.636363636363637) internal successors, (260), 11 states have internal predecessors, (260), 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-17 03:43:35,512 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:35,512 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:35,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:43:35,514 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:35,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:35,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1491294057, now seen corresponding path program 2 times [2024-11-17 03:43:35,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:35,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23176851] [2024-11-17 03:43:35,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:35,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:36,286 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-17 03:43:36,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23176851] [2024-11-17 03:43:36,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23176851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:36,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:36,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 03:43:36,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340806374] [2024-11-17 03:43:36,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:36,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:43:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:36,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:43:36,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:43:36,513 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-11-17 03:43:36,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 309 flow. Second operand has 11 states, 11 states have (on average 23.636363636363637) internal successors, (260), 11 states have internal predecessors, (260), 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-17 03:43:36,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:36,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-11-17 03:43:36,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:37,359 INFO L124 PetriNetUnfolderBase]: 1827/3861 cut-off events. [2024-11-17 03:43:37,360 INFO L125 PetriNetUnfolderBase]: For 3660/3668 co-relation queries the response was YES. [2024-11-17 03:43:37,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10016 conditions, 3861 events. 1827/3861 cut-off events. For 3660/3668 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 23647 event pairs, 631 based on Foata normal form. 0/3789 useless extension candidates. Maximal degree in co-relation 9989. Up to 2190 conditions per place. [2024-11-17 03:43:37,386 INFO L140 encePairwiseOnDemand]: 51/64 looper letters, 126 selfloop transitions, 25 changer transitions 0/167 dead transitions. [2024-11-17 03:43:37,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 167 transitions, 1045 flow [2024-11-17 03:43:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:43:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:43:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 391 transitions. [2024-11-17 03:43:37,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5091145833333334 [2024-11-17 03:43:37,388 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 309 flow. Second operand 12 states and 391 transitions. [2024-11-17 03:43:37,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 167 transitions, 1045 flow [2024-11-17 03:43:37,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 167 transitions, 1023 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-17 03:43:37,400 INFO L231 Difference]: Finished difference. Result has 98 places, 87 transitions, 557 flow [2024-11-17 03:43:37,401 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=557, PETRI_PLACES=98, PETRI_TRANSITIONS=87} [2024-11-17 03:43:37,401 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 42 predicate places. [2024-11-17 03:43:37,401 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 87 transitions, 557 flow [2024-11-17 03:43:37,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.636363636363637) internal successors, (260), 11 states have internal predecessors, (260), 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-17 03:43:37,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:37,402 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:37,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 03:43:37,402 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:37,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1159951703, now seen corresponding path program 3 times [2024-11-17 03:43:37,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:37,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400094233] [2024-11-17 03:43:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:37,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:38,004 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-17 03:43:38,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:38,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400094233] [2024-11-17 03:43:38,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400094233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:38,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:38,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:43:38,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047157228] [2024-11-17 03:43:38,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:38,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:43:38,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:38,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:43:38,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:43:38,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-11-17 03:43:38,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 87 transitions, 557 flow. Second operand has 10 states, 10 states have (on average 23.8) internal successors, (238), 10 states have internal predecessors, (238), 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-17 03:43:38,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:38,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-11-17 03:43:38,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:39,058 INFO L124 PetriNetUnfolderBase]: 2158/4569 cut-off events. [2024-11-17 03:43:39,059 INFO L125 PetriNetUnfolderBase]: For 6658/6668 co-relation queries the response was YES. [2024-11-17 03:43:39,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12693 conditions, 4569 events. 2158/4569 cut-off events. For 6658/6668 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 29540 event pairs, 608 based on Foata normal form. 0/4497 useless extension candidates. Maximal degree in co-relation 12658. Up to 2200 conditions per place. [2024-11-17 03:43:39,087 INFO L140 encePairwiseOnDemand]: 51/64 looper letters, 127 selfloop transitions, 48 changer transitions 0/191 dead transitions. [2024-11-17 03:43:39,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 191 transitions, 1411 flow [2024-11-17 03:43:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:43:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-17 03:43:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 379 transitions. [2024-11-17 03:43:39,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5383522727272727 [2024-11-17 03:43:39,090 INFO L175 Difference]: Start difference. First operand has 98 places, 87 transitions, 557 flow. Second operand 11 states and 379 transitions. [2024-11-17 03:43:39,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 191 transitions, 1411 flow [2024-11-17 03:43:39,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 191 transitions, 1337 flow, removed 37 selfloop flow, removed 0 redundant places. [2024-11-17 03:43:39,117 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 887 flow [2024-11-17 03:43:39,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=887, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2024-11-17 03:43:39,118 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 58 predicate places. [2024-11-17 03:43:39,118 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 887 flow [2024-11-17 03:43:39,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.8) internal successors, (238), 10 states have internal predecessors, (238), 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-17 03:43:39,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:39,119 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:39,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 03:43:39,119 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:39,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1229658087, now seen corresponding path program 4 times [2024-11-17 03:43:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:39,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941048206] [2024-11-17 03:43:39,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:39,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:39,738 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-17 03:43:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941048206] [2024-11-17 03:43:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941048206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:39,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:39,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-17 03:43:39,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489727913] [2024-11-17 03:43:39,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:39,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:43:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:39,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:43:39,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:43:39,930 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-11-17 03:43:39,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 887 flow. Second operand has 11 states, 11 states have (on average 23.636363636363637) internal successors, (260), 11 states have internal predecessors, (260), 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-17 03:43:39,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:39,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-11-17 03:43:39,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:40,823 INFO L124 PetriNetUnfolderBase]: 2474/5170 cut-off events. [2024-11-17 03:43:40,824 INFO L125 PetriNetUnfolderBase]: For 10350/10366 co-relation queries the response was YES. [2024-11-17 03:43:40,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15390 conditions, 5170 events. 2474/5170 cut-off events. For 10350/10366 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 34055 event pairs, 587 based on Foata normal form. 8/5081 useless extension candidates. Maximal degree in co-relation 15347. Up to 1779 conditions per place. [2024-11-17 03:43:40,856 INFO L140 encePairwiseOnDemand]: 51/64 looper letters, 124 selfloop transitions, 77 changer transitions 0/217 dead transitions. [2024-11-17 03:43:40,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 217 transitions, 1810 flow [2024-11-17 03:43:40,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:43:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:43:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 407 transitions. [2024-11-17 03:43:40,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5299479166666666 [2024-11-17 03:43:40,859 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 887 flow. Second operand 12 states and 407 transitions. [2024-11-17 03:43:40,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 217 transitions, 1810 flow [2024-11-17 03:43:40,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 217 transitions, 1695 flow, removed 52 selfloop flow, removed 1 redundant places. [2024-11-17 03:43:40,898 INFO L231 Difference]: Finished difference. Result has 131 places, 131 transitions, 1271 flow [2024-11-17 03:43:40,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1271, PETRI_PLACES=131, PETRI_TRANSITIONS=131} [2024-11-17 03:43:40,899 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 75 predicate places. [2024-11-17 03:43:40,899 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 131 transitions, 1271 flow [2024-11-17 03:43:40,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.636363636363637) internal successors, (260), 11 states have internal predecessors, (260), 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-17 03:43:40,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:40,900 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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-17 03:43:40,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 03:43:40,900 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:40,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:40,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1579002974, now seen corresponding path program 1 times [2024-11-17 03:43:40,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:40,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108425121] [2024-11-17 03:43:40,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:40,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 03:43:40,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:40,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108425121] [2024-11-17 03:43:40,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108425121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:43:40,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79417458] [2024-11-17 03:43:40,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:40,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:43:40,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:43:40,941 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-17 03:43:40,954 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-17 03:43:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:41,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:43:41,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 03:43:41,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:41,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79417458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:41,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:43:41,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-11-17 03:43:41,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368165864] [2024-11-17 03:43:41,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:41,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:41,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:41,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:41,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:43:41,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:41,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 131 transitions, 1271 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-17 03:43:41,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:41,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:41,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:41,606 INFO L124 PetriNetUnfolderBase]: 1894/4319 cut-off events. [2024-11-17 03:43:41,606 INFO L125 PetriNetUnfolderBase]: For 11118/11146 co-relation queries the response was YES. [2024-11-17 03:43:41,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13437 conditions, 4319 events. 1894/4319 cut-off events. For 11118/11146 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 30040 event pairs, 1190 based on Foata normal form. 13/4230 useless extension candidates. Maximal degree in co-relation 13386. Up to 3194 conditions per place. [2024-11-17 03:43:41,646 INFO L140 encePairwiseOnDemand]: 62/64 looper letters, 110 selfloop transitions, 1 changer transitions 2/130 dead transitions. [2024-11-17 03:43:41,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 130 transitions, 1495 flow [2024-11-17 03:43:41,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-11-17 03:43:41,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-11-17 03:43:41,648 INFO L175 Difference]: Start difference. First operand has 131 places, 131 transitions, 1271 flow. Second operand 3 states and 100 transitions. [2024-11-17 03:43:41,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 130 transitions, 1495 flow [2024-11-17 03:43:41,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 130 transitions, 1425 flow, removed 35 selfloop flow, removed 0 redundant places. [2024-11-17 03:43:41,693 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 1196 flow [2024-11-17 03:43:41,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1196, PETRI_PLACES=132, PETRI_TRANSITIONS=128} [2024-11-17 03:43:41,695 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 76 predicate places. [2024-11-17 03:43:41,695 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 1196 flow [2024-11-17 03:43:41,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-17 03:43:41,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:41,696 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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-17 03:43:41,712 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-17 03:43:41,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 03:43:41,897 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:41,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash 404789456, now seen corresponding path program 1 times [2024-11-17 03:43:41,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:41,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466281862] [2024-11-17 03:43:41,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:43:41,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:43:41,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466281862] [2024-11-17 03:43:41,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466281862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:41,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:41,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:43:41,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355337861] [2024-11-17 03:43:41,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:41,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:41,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:43:41,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:41,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:41,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:41,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 1196 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-17 03:43:41,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:41,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:41,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:42,389 INFO L124 PetriNetUnfolderBase]: 1853/4108 cut-off events. [2024-11-17 03:43:42,389 INFO L125 PetriNetUnfolderBase]: For 8998/9022 co-relation queries the response was YES. [2024-11-17 03:43:42,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12478 conditions, 4108 events. 1853/4108 cut-off events. For 8998/9022 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 27166 event pairs, 419 based on Foata normal form. 39/4072 useless extension candidates. Maximal degree in co-relation 12425. Up to 2412 conditions per place. [2024-11-17 03:43:42,422 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 115 selfloop transitions, 7 changer transitions 11/149 dead transitions. [2024-11-17 03:43:42,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 149 transitions, 1611 flow [2024-11-17 03:43:42,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-17 03:43:42,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-17 03:43:42,424 INFO L175 Difference]: Start difference. First operand has 132 places, 128 transitions, 1196 flow. Second operand 3 states and 112 transitions. [2024-11-17 03:43:42,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 149 transitions, 1611 flow [2024-11-17 03:43:42,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 149 transitions, 1533 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-17 03:43:42,453 INFO L231 Difference]: Finished difference. Result has 130 places, 120 transitions, 1081 flow [2024-11-17 03:43:42,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1081, PETRI_PLACES=130, PETRI_TRANSITIONS=120} [2024-11-17 03:43:42,454 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 74 predicate places. [2024-11-17 03:43:42,454 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 120 transitions, 1081 flow [2024-11-17 03:43:42,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-17 03:43:42,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:42,454 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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-17 03:43:42,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 03:43:42,455 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:42,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:42,455 INFO L85 PathProgramCache]: Analyzing trace with hash 637384894, now seen corresponding path program 1 times [2024-11-17 03:43:42,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:43:42,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674439892] [2024-11-17 03:43:42,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:42,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:43:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 03:43:42,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2020308805] [2024-11-17 03:43:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:42,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:43:42,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:43:42,484 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-17 03:43:42,486 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-17 03:43:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:43:42,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:43:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:43:42,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:43:42,756 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:43:42,757 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-17 03:43:42,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-17 03:43:42,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-17 03:43:42,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-17 03:43:42,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-17 03:43:42,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-17 03:43:42,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-17 03:43:42,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-17 03:43:42,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-17 03:43:42,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-17 03:43:42,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-17 03:43:42,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-17 03:43:42,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-17 03:43:42,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-17 03:43:42,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-17 03:43:42,778 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-17 03:43:42,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-17 03:43:42,961 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:43,022 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:43:43,022 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:43:43,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:43:43 BasicIcfg [2024-11-17 03:43:43,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:43:43,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:43:43,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:43:43,027 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:43:43,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:43:27" (3/4) ... [2024-11-17 03:43:43,031 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:43:43,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:43:43,032 INFO L158 Benchmark]: Toolchain (without parser) took 16715.31ms. Allocated memory was 146.8MB in the beginning and 469.8MB in the end (delta: 323.0MB). Free memory was 89.0MB in the beginning and 182.5MB in the end (delta: -93.5MB). Peak memory consumption was 230.9MB. Max. memory is 16.1GB. [2024-11-17 03:43:43,032 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:43:43,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.90ms. Allocated memory is still 146.8MB. Free memory was 88.6MB in the beginning and 65.2MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 03:43:43,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.44ms. Allocated memory is still 146.8MB. Free memory was 65.2MB in the beginning and 63.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:43:43,033 INFO L158 Benchmark]: Boogie Preprocessor took 77.26ms. Allocated memory is still 146.8MB. Free memory was 63.1MB in the beginning and 115.1MB in the end (delta: -52.0MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-17 03:43:43,033 INFO L158 Benchmark]: IcfgBuilder took 814.70ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 115.0MB in the beginning and 131.0MB in the end (delta: -16.0MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-11-17 03:43:43,034 INFO L158 Benchmark]: TraceAbstraction took 15191.26ms. Allocated memory was 201.3MB in the beginning and 469.8MB in the end (delta: 268.4MB). Free memory was 129.9MB in the beginning and 182.5MB in the end (delta: -52.6MB). Peak memory consumption was 215.9MB. Max. memory is 16.1GB. [2024-11-17 03:43:43,034 INFO L158 Benchmark]: Witness Printer took 5.03ms. Allocated memory is still 469.8MB. Free memory is still 182.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:43:43,035 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.18ms. Allocated memory is still 146.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.90ms. Allocated memory is still 146.8MB. Free memory was 88.6MB in the beginning and 65.2MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.44ms. Allocated memory is still 146.8MB. Free memory was 65.2MB in the beginning and 63.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.26ms. Allocated memory is still 146.8MB. Free memory was 63.1MB in the beginning and 115.1MB in the end (delta: -52.0MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * IcfgBuilder took 814.70ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 115.0MB in the beginning and 131.0MB in the end (delta: -16.0MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15191.26ms. Allocated memory was 201.3MB in the beginning and 469.8MB in the end (delta: 268.4MB). Free memory was 129.9MB in the beginning and 182.5MB in the end (delta: -52.6MB). Peak memory consumption was 215.9MB. Max. memory is 16.1GB. * Witness Printer took 5.03ms. Allocated memory is still 469.8MB. Free memory is still 182.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 681. Possible FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 754]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: 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: 762]: 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 97 locations, 15 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: 15.0s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1134 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1003 mSDsluCounter, 618 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 586 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4001 IncrementalHoareTripleChecker+Invalid, 4024 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 32 mSDtfsCounter, 4001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1271occurred in iteration=15, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 3303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 401 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 21/23 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-17 03:43:43,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/circular_buffer_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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:43:45,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:43:45,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:43:45,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:43:45,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:43:45,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:43:45,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:43:45,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:43:45,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:43:45,397 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:43:45,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:43:45,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:43:45,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:43:45,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:43:45,399 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:43:45,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:43:45,400 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:43:45,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:43:45,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:43:45,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:43:45,401 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:43:45,404 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:43:45,404 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:43:45,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:43:45,405 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:43:45,405 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:43:45,405 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:43:45,406 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:43:45,406 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:43:45,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:43:45,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:43:45,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:43:45,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:43:45,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:43:45,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:43:45,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:43:45,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:43:45,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:43:45,410 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:43:45,410 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:43:45,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:43:45,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:43:45,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:43:45,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:43:45,411 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-11-17 03:43:45,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:43:45,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:43:45,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:43:45,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:43:45,772 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:43:45,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-17 03:43:47,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:43:47,569 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:43:47,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-17 03:43:47,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3d31b6a/3c5f9a747c07412ea6526e51bea2f8c4/FLAGa9924f391 [2024-11-17 03:43:47,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3d31b6a/3c5f9a747c07412ea6526e51bea2f8c4 [2024-11-17 03:43:47,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:43:47,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:43:47,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:43:47,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:43:47,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:43:47,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:43:47" (1/1) ... [2024-11-17 03:43:47,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa20849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:47, skipping insertion in model container [2024-11-17 03:43:47,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:43:47" (1/1) ... [2024-11-17 03:43:47,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:43:48,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:43:48,061 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:43:48,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:43:48,171 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:43:48,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48 WrapperNode [2024-11-17 03:43:48,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:43:48,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:43:48,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:43:48,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:43:48,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,252 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 139 [2024-11-17 03:43:48,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:43:48,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:43:48,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:43:48,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:43:48,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,297 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2024-11-17 03:43:48,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,313 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:43:48,330 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:43:48,330 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:43:48,330 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:43:48,331 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (1/1) ... [2024-11-17 03:43:48,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:43:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:43:48,367 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-17 03:43:48,380 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-17 03:43:48,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 03:43:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 03:43:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 03:43:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-17 03:43:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-17 03:43:48,423 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-17 03:43:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-17 03:43:48,424 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-17 03:43:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-17 03:43:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:43:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-17 03:43:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-17 03:43:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-17 03:43:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-17 03:43:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 03:43:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 03:43:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 03:43:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-17 03:43:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-17 03:43:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-17 03:43:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-17 03:43:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-17 03:43:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:43:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 03:43:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 03:43:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-17 03:43:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-17 03:43:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-17 03:43:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-17 03:43:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-17 03:43:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-17 03:43:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:43:48,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:43:48,429 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:43:48,639 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:43:48,642 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:43:48,945 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem2#1; [2024-11-17 03:43:48,947 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:43:48,947 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:43:49,179 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:43:49,180 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:43:49,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:43:49 BoogieIcfgContainer [2024-11-17 03:43:49,181 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:43:49,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:43:49,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:43:49,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:43:49,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:43:47" (1/3) ... [2024-11-17 03:43:49,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2577aa78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:43:49, skipping insertion in model container [2024-11-17 03:43:49,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:48" (2/3) ... [2024-11-17 03:43:49,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2577aa78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:43:49, skipping insertion in model container [2024-11-17 03:43:49,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:43:49" (3/3) ... [2024-11-17 03:43:49,191 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-17 03:43:49,206 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:43:49,207 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-17 03:43:49,207 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:43:49,256 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-17 03:43:49,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 64 transitions, 142 flow [2024-11-17 03:43:49,319 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2024-11-17 03:43:49,319 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:43:49,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 62 events. 12/62 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 163 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-11-17 03:43:49,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 64 transitions, 142 flow [2024-11-17 03:43:49,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 61 transitions, 134 flow [2024-11-17 03:43:49,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:43:49,350 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;@390e1231, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:43:49,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-17 03:43:49,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:43:49,360 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2024-11-17 03:43:49,360 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:43:49,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:49,361 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:49,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:49,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:49,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1419189318, now seen corresponding path program 1 times [2024-11-17 03:43:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:49,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619039318] [2024-11-17 03:43:49,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:49,389 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-17 03:43:49,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:49,391 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-17 03:43:49,392 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-17 03:43:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:49,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:43:49,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:49,679 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-17 03:43:49,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:49,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619039318] [2024-11-17 03:43:49,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619039318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:49,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:43:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257671135] [2024-11-17 03:43:49,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:49,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:49,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:49,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:49,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:49,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-11-17 03:43:49,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:43:49,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:49,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-11-17 03:43:49,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:50,050 INFO L124 PetriNetUnfolderBase]: 445/847 cut-off events. [2024-11-17 03:43:50,051 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-17 03:43:50,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 847 events. 445/847 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4605 event pairs, 330 based on Foata normal form. 136/880 useless extension candidates. Maximal degree in co-relation 1514. Up to 711 conditions per place. [2024-11-17 03:43:50,064 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 30 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2024-11-17 03:43:50,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 176 flow [2024-11-17 03:43:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-11-17 03:43:50,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-11-17 03:43:50,092 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 134 flow. Second operand 3 states and 105 transitions. [2024-11-17 03:43:50,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 176 flow [2024-11-17 03:43:50,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:43:50,099 INFO L231 Difference]: Finished difference. Result has 50 places, 51 transitions, 108 flow [2024-11-17 03:43:50,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=51} [2024-11-17 03:43:50,107 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2024-11-17 03:43:50,107 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 51 transitions, 108 flow [2024-11-17 03:43:50,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:43:50,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:50,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:50,113 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-17 03:43:50,311 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-17 03:43:50,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:50,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1419189319, now seen corresponding path program 1 times [2024-11-17 03:43:50,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:50,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552953981] [2024-11-17 03:43:50,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:50,313 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-17 03:43:50,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:50,316 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-17 03:43:50,317 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-17 03:43:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:50,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:43:50,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:50,561 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-17 03:43:50,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:50,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552953981] [2024-11-17 03:43:50,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552953981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:50,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:50,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:43:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224654934] [2024-11-17 03:43:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:50,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:50,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:50,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:50,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-17 03:43:50,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:50,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:50,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:50,878 INFO L124 PetriNetUnfolderBase]: 788/1535 cut-off events. [2024-11-17 03:43:50,878 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-17 03:43:50,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1535 events. 788/1535 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8649 event pairs, 263 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 2766. Up to 698 conditions per place. [2024-11-17 03:43:50,886 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 55 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-11-17 03:43:50,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 275 flow [2024-11-17 03:43:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-11-17 03:43:50,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-17 03:43:50,889 INFO L175 Difference]: Start difference. First operand has 50 places, 51 transitions, 108 flow. Second operand 3 states and 128 transitions. [2024-11-17 03:43:50,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 275 flow [2024-11-17 03:43:50,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:43:50,893 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 121 flow [2024-11-17 03:43:50,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2024-11-17 03:43:50,894 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2024-11-17 03:43:50,894 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 121 flow [2024-11-17 03:43:50,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-17 03:43:50,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:50,895 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:50,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 03:43:51,095 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-17 03:43:51,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:51,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash -588663188, now seen corresponding path program 1 times [2024-11-17 03:43:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:51,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990113469] [2024-11-17 03:43:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:51,097 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-17 03:43:51,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:51,100 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-17 03:43:51,101 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-17 03:43:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:51,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:43:51,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:51,306 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-17 03:43:51,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:51,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:51,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990113469] [2024-11-17 03:43:51,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990113469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:51,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:51,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:43:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103740633] [2024-11-17 03:43:51,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:51,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:43:51,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:43:51,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:43:51,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-17 03:43:51,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-17 03:43:51,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:51,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-17 03:43:51,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:51,709 INFO L124 PetriNetUnfolderBase]: 986/2083 cut-off events. [2024-11-17 03:43:51,710 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-11-17 03:43:51,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3803 conditions, 2083 events. 986/2083 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 12251 event pairs, 195 based on Foata normal form. 75/2013 useless extension candidates. Maximal degree in co-relation 3795. Up to 627 conditions per place. [2024-11-17 03:43:51,721 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 77 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2024-11-17 03:43:51,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 100 transitions, 387 flow [2024-11-17 03:43:51,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:43:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:43:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2024-11-17 03:43:51,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.69921875 [2024-11-17 03:43:51,728 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 121 flow. Second operand 4 states and 179 transitions. [2024-11-17 03:43:51,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 100 transitions, 387 flow [2024-11-17 03:43:51,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 100 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:43:51,730 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 141 flow [2024-11-17 03:43:51,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2024-11-17 03:43:51,732 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2024-11-17 03:43:51,732 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 141 flow [2024-11-17 03:43:51,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-17 03:43:51,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:51,734 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:51,746 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-17 03:43:51,934 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-17 03:43:51,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:51,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:51,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1040543833, now seen corresponding path program 1 times [2024-11-17 03:43:51,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:51,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133024980] [2024-11-17 03:43:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:51,936 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-17 03:43:51,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:51,937 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-17 03:43:51,938 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-17 03:43:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:52,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:43:52,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:43:52,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:52,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:52,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133024980] [2024-11-17 03:43:52,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133024980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:52,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:43:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769184662] [2024-11-17 03:43:52,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:52,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:52,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:52,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:52,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:52,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-17 03:43:52,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:52,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:52,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:52,425 INFO L124 PetriNetUnfolderBase]: 1101/2307 cut-off events. [2024-11-17 03:43:52,425 INFO L125 PetriNetUnfolderBase]: For 415/447 co-relation queries the response was YES. [2024-11-17 03:43:52,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 2307 events. 1101/2307 cut-off events. For 415/447 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 14315 event pairs, 484 based on Foata normal form. 0/2120 useless extension candidates. Maximal degree in co-relation 4471. Up to 1041 conditions per place. [2024-11-17 03:43:52,439 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 52 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2024-11-17 03:43:52,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 315 flow [2024-11-17 03:43:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-11-17 03:43:52,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.640625 [2024-11-17 03:43:52,441 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 141 flow. Second operand 3 states and 123 transitions. [2024-11-17 03:43:52,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 315 flow [2024-11-17 03:43:52,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:43:52,446 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 163 flow [2024-11-17 03:43:52,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2024-11-17 03:43:52,448 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-11-17 03:43:52,448 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 163 flow [2024-11-17 03:43:52,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-17 03:43:52,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:52,448 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:52,454 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-17 03:43:52,655 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-17 03:43:52,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:52,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1674788754, now seen corresponding path program 1 times [2024-11-17 03:43:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125265438] [2024-11-17 03:43:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:52,656 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-17 03:43:52,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:52,659 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-17 03:43:52,660 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-17 03:43:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:52,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:43:52,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:52,741 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-17 03:43:52,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:52,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:52,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125265438] [2024-11-17 03:43:52,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125265438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:52,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:52,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:43:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535276869] [2024-11-17 03:43:52,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:52,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:52,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:52,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:52,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:52,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-17 03:43:52,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:52,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:52,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:53,190 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L717-->L733-3: Formula: (and (= (_ bv1 8) v_~receive~0_69) (= v_~send~0_79 (_ bv0 8))) InVars {} OutVars{t1Thread1of1ForFork0_insertLogElement_~b#1=|v_t1Thread1of1ForFork0_insertLogElement_~b#1_5|, ~receive~0=v_~receive~0_69, t1Thread1of1ForFork0_#t~ret4#1=|v_t1Thread1of1ForFork0_#t~ret4#1_1|, t1Thread1of1ForFork0_insertLogElement_#in~b#1=|v_t1Thread1of1ForFork0_insertLogElement_#in~b#1_3|, ~send~0=v_~send~0_79} AuxVars[] AssignedVars[~receive~0, t1Thread1of1ForFork0_#t~ret4#1, t1Thread1of1ForFork0_insertLogElement_#in~b#1, t1Thread1of1ForFork0_insertLogElement_~b#1, ~send~0][45], [Black: 170#(= (_ bv0 8) ~receive~0), Black: 156#(and (= (_ bv10 32) ~buffer_size~0) (= (_ bv1 32) ~next~0)), Black: 128#(and (= (_ bv10 32) ~buffer_size~0) (= (_ bv0 32) ~next~0)), 67#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv3 32)))) (= (_ bv3 32) |~#buffer~0.base|)), 3#L763true, 165#true, 50#L733-3true, Black: 97#(and (= (_ bv0 32) ~next~0) (= (_ bv10 32) (select |#length| (_ bv3 32))) (= (_ bv3 32) |~#buffer~0.base|) (= (_ bv0 32) |~#buffer~0.offset|)), 36#L750-3true, 212#true]) [2024-11-17 03:43:53,191 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-11-17 03:43:53,191 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-17 03:43:53,191 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-17 03:43:53,191 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-17 03:43:53,193 INFO L124 PetriNetUnfolderBase]: 1397/2838 cut-off events. [2024-11-17 03:43:53,193 INFO L125 PetriNetUnfolderBase]: For 686/693 co-relation queries the response was YES. [2024-11-17 03:43:53,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5799 conditions, 2838 events. 1397/2838 cut-off events. For 686/693 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 17974 event pairs, 599 based on Foata normal form. 12/2608 useless extension candidates. Maximal degree in co-relation 5786. Up to 1924 conditions per place. [2024-11-17 03:43:53,209 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 55 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-11-17 03:43:53,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 339 flow [2024-11-17 03:43:53,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-11-17 03:43:53,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-11-17 03:43:53,211 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 163 flow. Second operand 3 states and 124 transitions. [2024-11-17 03:43:53,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 339 flow [2024-11-17 03:43:53,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:43:53,216 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 167 flow [2024-11-17 03:43:53,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2024-11-17 03:43:53,216 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2024-11-17 03:43:53,217 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 167 flow [2024-11-17 03:43:53,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-17 03:43:53,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:53,217 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:53,222 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-17 03:43:53,420 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-17 03:43:53,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:53,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:53,422 INFO L85 PathProgramCache]: Analyzing trace with hash -815916161, now seen corresponding path program 1 times [2024-11-17 03:43:53,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:53,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343676946] [2024-11-17 03:43:53,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:53,423 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-17 03:43:53,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:53,424 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-17 03:43:53,425 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-17 03:43:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:53,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:43:53,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:43:53,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:53,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343676946] [2024-11-17 03:43:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343676946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:53,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:53,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:43:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252919139] [2024-11-17 03:43:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:53,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:53,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:53,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:43:53,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:53,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:53,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:53,933 INFO L124 PetriNetUnfolderBase]: 1176/2513 cut-off events. [2024-11-17 03:43:53,933 INFO L125 PetriNetUnfolderBase]: For 322/334 co-relation queries the response was YES. [2024-11-17 03:43:53,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4994 conditions, 2513 events. 1176/2513 cut-off events. For 322/334 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 14635 event pairs, 422 based on Foata normal form. 0/2344 useless extension candidates. Maximal degree in co-relation 4981. Up to 1340 conditions per place. [2024-11-17 03:43:53,948 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 49 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2024-11-17 03:43:53,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 309 flow [2024-11-17 03:43:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-11-17 03:43:53,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2024-11-17 03:43:53,950 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 167 flow. Second operand 3 states and 118 transitions. [2024-11-17 03:43:53,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 309 flow [2024-11-17 03:43:53,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 304 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-17 03:43:53,981 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 177 flow [2024-11-17 03:43:53,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-11-17 03:43:53,982 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2024-11-17 03:43:53,982 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 177 flow [2024-11-17 03:43:53,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:43:53,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:53,983 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:53,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-17 03:43:54,187 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-17 03:43:54,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:54,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1562439525, now seen corresponding path program 1 times [2024-11-17 03:43:54,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:54,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775985577] [2024-11-17 03:43:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:54,189 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-17 03:43:54,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:54,191 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-17 03:43:54,192 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-17 03:43:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:54,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:43:54,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:54,353 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-17 03:43:54,382 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-17 03:43:54,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:54,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:54,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775985577] [2024-11-17 03:43:54,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775985577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:54,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:54,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:43:54,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331882970] [2024-11-17 03:43:54,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:54,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:54,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:54,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:54,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:54,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-17 03:43:54,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 03:43:54,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:54,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-17 03:43:54,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:54,655 INFO L124 PetriNetUnfolderBase]: 724/1790 cut-off events. [2024-11-17 03:43:54,656 INFO L125 PetriNetUnfolderBase]: For 428/428 co-relation queries the response was YES. [2024-11-17 03:43:54,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3587 conditions, 1790 events. 724/1790 cut-off events. For 428/428 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9998 event pairs, 239 based on Foata normal form. 76/1765 useless extension candidates. Maximal degree in co-relation 3573. Up to 668 conditions per place. [2024-11-17 03:43:54,664 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 41 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-11-17 03:43:54,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 67 transitions, 297 flow [2024-11-17 03:43:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-11-17 03:43:54,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2024-11-17 03:43:54,665 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 177 flow. Second operand 3 states and 115 transitions. [2024-11-17 03:43:54,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 67 transitions, 297 flow [2024-11-17 03:43:54,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 67 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:43:54,669 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 179 flow [2024-11-17 03:43:54,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-11-17 03:43:54,670 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2024-11-17 03:43:54,670 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 179 flow [2024-11-17 03:43:54,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 03:43:54,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:54,670 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:54,677 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-17 03:43:54,871 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-17 03:43:54,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:54,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash -612029121, now seen corresponding path program 1 times [2024-11-17 03:43:54,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:54,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061007522] [2024-11-17 03:43:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:54,872 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-17 03:43:54,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:54,876 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-17 03:43:54,877 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-17 03:43:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:54,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:43:54,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:54,972 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-17 03:43:54,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:54,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061007522] [2024-11-17 03:43:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061007522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:54,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:54,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:43:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806954120] [2024-11-17 03:43:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:54,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:43:54,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:54,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:43:54,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:43:54,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:54,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 03:43:54,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:54,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:54,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:55,253 INFO L124 PetriNetUnfolderBase]: 649/1558 cut-off events. [2024-11-17 03:43:55,253 INFO L125 PetriNetUnfolderBase]: For 477/481 co-relation queries the response was YES. [2024-11-17 03:43:55,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3296 conditions, 1558 events. 649/1558 cut-off events. For 477/481 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8511 event pairs, 262 based on Foata normal form. 0/1437 useless extension candidates. Maximal degree in co-relation 3282. Up to 731 conditions per place. [2024-11-17 03:43:55,262 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 47 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2024-11-17 03:43:55,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 318 flow [2024-11-17 03:43:55,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:43:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:43:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-11-17 03:43:55,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-11-17 03:43:55,266 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 179 flow. Second operand 3 states and 116 transitions. [2024-11-17 03:43:55,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 318 flow [2024-11-17 03:43:55,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:43:55,270 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 177 flow [2024-11-17 03:43:55,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2024-11-17 03:43:55,271 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-11-17 03:43:55,272 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 177 flow [2024-11-17 03:43:55,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 03:43:55,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:55,272 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] [2024-11-17 03:43:55,279 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-17 03:43:55,472 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-17 03:43:55,473 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:55,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:55,474 INFO L85 PathProgramCache]: Analyzing trace with hash 589735651, now seen corresponding path program 1 times [2024-11-17 03:43:55,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:55,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672024177] [2024-11-17 03:43:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:55,474 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-17 03:43:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:55,477 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-17 03:43:55,478 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-17 03:43:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:55,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:43:55,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:55,966 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-17 03:43:55,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:55,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:55,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672024177] [2024-11-17 03:43:55,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672024177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:55,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:55,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:43:55,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019733177] [2024-11-17 03:43:55,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:55,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:43:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:55,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:43:55,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:43:55,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2024-11-17 03:43:55,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-17 03:43:55,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:55,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2024-11-17 03:43:55,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:56,399 INFO L124 PetriNetUnfolderBase]: 1217/2957 cut-off events. [2024-11-17 03:43:56,400 INFO L125 PetriNetUnfolderBase]: For 933/945 co-relation queries the response was YES. [2024-11-17 03:43:56,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6067 conditions, 2957 events. 1217/2957 cut-off events. For 933/945 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 18593 event pairs, 625 based on Foata normal form. 0/2761 useless extension candidates. Maximal degree in co-relation 6051. Up to 1006 conditions per place. [2024-11-17 03:43:56,418 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 83 selfloop transitions, 3 changer transitions 0/106 dead transitions. [2024-11-17 03:43:56,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 106 transitions, 525 flow [2024-11-17 03:43:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:43:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:43:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2024-11-17 03:43:56,420 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2024-11-17 03:43:56,421 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 177 flow. Second operand 4 states and 174 transitions. [2024-11-17 03:43:56,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 106 transitions, 525 flow [2024-11-17 03:43:56,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 106 transitions, 511 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:43:56,425 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 187 flow [2024-11-17 03:43:56,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2024-11-17 03:43:56,427 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2024-11-17 03:43:56,427 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 187 flow [2024-11-17 03:43:56,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-17 03:43:56,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:56,428 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:56,436 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 (10)] Forceful destruction successful, exit code 0 [2024-11-17 03:43:56,629 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-17 03:43:56,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:56,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:56,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1377330662, now seen corresponding path program 1 times [2024-11-17 03:43:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:56,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353223123] [2024-11-17 03:43:56,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:56,630 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-17 03:43:56,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:56,632 INFO L229 MonitoredProcess]: Starting monitored process 11 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-17 03:43:56,633 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 (11)] Waiting until timeout for monitored process [2024-11-17 03:43:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:56,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:43:56,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:43:56,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:56,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:56,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353223123] [2024-11-17 03:43:56,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353223123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:56,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:56,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:43:56,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281729653] [2024-11-17 03:43:56,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:56,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:43:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:56,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:43:56,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:43:56,985 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-17 03:43:56,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-17 03:43:56,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:56,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-17 03:43:56,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:57,273 INFO L124 PetriNetUnfolderBase]: 847/2057 cut-off events. [2024-11-17 03:43:57,273 INFO L125 PetriNetUnfolderBase]: For 539/539 co-relation queries the response was YES. [2024-11-17 03:43:57,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4211 conditions, 2057 events. 847/2057 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 11368 event pairs, 330 based on Foata normal form. 9/1974 useless extension candidates. Maximal degree in co-relation 4194. Up to 1027 conditions per place. [2024-11-17 03:43:57,285 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 58 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2024-11-17 03:43:57,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 381 flow [2024-11-17 03:43:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:43:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:43:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2024-11-17 03:43:57,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6015625 [2024-11-17 03:43:57,290 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 187 flow. Second operand 4 states and 154 transitions. [2024-11-17 03:43:57,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 381 flow [2024-11-17 03:43:57,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 381 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-17 03:43:57,293 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 197 flow [2024-11-17 03:43:57,294 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-11-17 03:43:57,294 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-11-17 03:43:57,295 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 197 flow [2024-11-17 03:43:57,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-17 03:43:57,296 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:57,296 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:57,302 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 (11)] Ended with exit code 0 [2024-11-17 03:43:57,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-17 03:43:57,496 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:57,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash 230063148, now seen corresponding path program 1 times [2024-11-17 03:43:57,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:57,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83589296] [2024-11-17 03:43:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:43:57,498 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-17 03:43:57,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:57,500 INFO L229 MonitoredProcess]: Starting monitored process 12 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-17 03:43:57,501 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 (12)] Waiting until timeout for monitored process [2024-11-17 03:43:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:43:57,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 03:43:57,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:57,855 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 12 treesize of output 8 [2024-11-17 03:43:57,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-17 03:43:58,022 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-17 03:43:58,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:58,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:58,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83589296] [2024-11-17 03:43:58,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83589296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:58,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:58,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:43:58,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925204899] [2024-11-17 03:43:58,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:58,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:43:58,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:58,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:43:58,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:43:58,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-11-17 03:43:58,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 197 flow. Second operand has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 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-17 03:43:58,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:43:58,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-11-17 03:43:58,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:43:59,159 INFO L124 PetriNetUnfolderBase]: 1418/3109 cut-off events. [2024-11-17 03:43:59,159 INFO L125 PetriNetUnfolderBase]: For 1167/1179 co-relation queries the response was YES. [2024-11-17 03:43:59,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6732 conditions, 3109 events. 1418/3109 cut-off events. For 1167/1179 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 17700 event pairs, 577 based on Foata normal form. 19/3075 useless extension candidates. Maximal degree in co-relation 6712. Up to 2007 conditions per place. [2024-11-17 03:43:59,176 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 104 selfloop transitions, 14 changer transitions 0/137 dead transitions. [2024-11-17 03:43:59,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 137 transitions, 680 flow [2024-11-17 03:43:59,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:43:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-17 03:43:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 355 transitions. [2024-11-17 03:43:59,181 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5042613636363636 [2024-11-17 03:43:59,181 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 197 flow. Second operand 11 states and 355 transitions. [2024-11-17 03:43:59,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 137 transitions, 680 flow [2024-11-17 03:43:59,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 137 transitions, 671 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-17 03:43:59,186 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 305 flow [2024-11-17 03:43:59,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=305, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2024-11-17 03:43:59,187 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 28 predicate places. [2024-11-17 03:43:59,187 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 305 flow [2024-11-17 03:43:59,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 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-17 03:43:59,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:43:59,188 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:43:59,194 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 (12)] Ended with exit code 0 [2024-11-17 03:43:59,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-17 03:43:59,389 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:43:59,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:43:59,389 INFO L85 PathProgramCache]: Analyzing trace with hash 329225964, now seen corresponding path program 2 times [2024-11-17 03:43:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:43:59,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994498135] [2024-11-17 03:43:59,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:43:59,390 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-17 03:43:59,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:43:59,391 INFO L229 MonitoredProcess]: Starting monitored process 13 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-17 03:43:59,392 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 (13)] Waiting until timeout for monitored process [2024-11-17 03:43:59,501 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:43:59,501 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:43:59,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 03:43:59,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:43:59,722 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 12 treesize of output 8 [2024-11-17 03:43:59,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-17 03:43:59,885 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-17 03:43:59,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:43:59,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:43:59,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994498135] [2024-11-17 03:43:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994498135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:43:59,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:43:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:43:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146954570] [2024-11-17 03:43:59,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:43:59,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:43:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:43:59,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:43:59,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:44:00,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-11-17 03:44:00,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 305 flow. Second operand has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 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-17 03:44:00,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:44:00,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-11-17 03:44:00,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:44:00,848 INFO L124 PetriNetUnfolderBase]: 1676/3643 cut-off events. [2024-11-17 03:44:00,849 INFO L125 PetriNetUnfolderBase]: For 3400/3412 co-relation queries the response was YES. [2024-11-17 03:44:00,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9381 conditions, 3643 events. 1676/3643 cut-off events. For 3400/3412 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 21530 event pairs, 708 based on Foata normal form. 31/3613 useless extension candidates. Maximal degree in co-relation 9354. Up to 2361 conditions per place. [2024-11-17 03:44:00,868 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 107 selfloop transitions, 20 changer transitions 0/146 dead transitions. [2024-11-17 03:44:00,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 146 transitions, 889 flow [2024-11-17 03:44:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:44:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-17 03:44:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 356 transitions. [2024-11-17 03:44:00,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5056818181818182 [2024-11-17 03:44:00,872 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 305 flow. Second operand 11 states and 356 transitions. [2024-11-17 03:44:00,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 146 transitions, 889 flow [2024-11-17 03:44:00,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 146 transitions, 868 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-17 03:44:00,885 INFO L231 Difference]: Finished difference. Result has 99 places, 85 transitions, 514 flow [2024-11-17 03:44:00,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=514, PETRI_PLACES=99, PETRI_TRANSITIONS=85} [2024-11-17 03:44:00,887 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 43 predicate places. [2024-11-17 03:44:00,888 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 514 flow [2024-11-17 03:44:00,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 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-17 03:44:00,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:44:00,888 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:44:00,895 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 (13)] Ended with exit code 0 [2024-11-17 03:44:01,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-17 03:44:01,089 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:44:01,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:44:01,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1588197550, now seen corresponding path program 3 times [2024-11-17 03:44:01,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:44:01,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002663080] [2024-11-17 03:44:01,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:44:01,090 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-17 03:44:01,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:44:01,092 INFO L229 MonitoredProcess]: Starting monitored process 14 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-17 03:44:01,093 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 (14)] Waiting until timeout for monitored process [2024-11-17 03:44:01,210 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-17 03:44:01,211 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:44:01,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 03:44:01,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:44:01,390 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 12 treesize of output 8 [2024-11-17 03:44:01,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-17 03:44:01,589 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-17 03:44:01,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:44:01,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:44:01,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002663080] [2024-11-17 03:44:01,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002663080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:44:01,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:44:01,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:44:01,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195087466] [2024-11-17 03:44:01,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:44:01,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:44:01,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:44:01,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:44:01,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:44:01,776 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-11-17 03:44:01,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 85 transitions, 514 flow. Second operand has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 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-17 03:44:01,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:44:01,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-11-17 03:44:01,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:44:02,683 INFO L124 PetriNetUnfolderBase]: 1889/4095 cut-off events. [2024-11-17 03:44:02,683 INFO L125 PetriNetUnfolderBase]: For 8108/8126 co-relation queries the response was YES. [2024-11-17 03:44:02,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11820 conditions, 4095 events. 1889/4095 cut-off events. For 8108/8126 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 25005 event pairs, 708 based on Foata normal form. 17/4041 useless extension candidates. Maximal degree in co-relation 11786. Up to 2735 conditions per place. [2024-11-17 03:44:02,709 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 122 selfloop transitions, 20 changer transitions 0/161 dead transitions. [2024-11-17 03:44:02,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 161 transitions, 1137 flow [2024-11-17 03:44:02,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:44:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-17 03:44:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 355 transitions. [2024-11-17 03:44:02,715 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5042613636363636 [2024-11-17 03:44:02,715 INFO L175 Difference]: Start difference. First operand has 99 places, 85 transitions, 514 flow. Second operand 11 states and 355 transitions. [2024-11-17 03:44:02,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 161 transitions, 1137 flow [2024-11-17 03:44:02,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 161 transitions, 1063 flow, removed 36 selfloop flow, removed 1 redundant places. [2024-11-17 03:44:02,739 INFO L231 Difference]: Finished difference. Result has 114 places, 97 transitions, 643 flow [2024-11-17 03:44:02,740 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=643, PETRI_PLACES=114, PETRI_TRANSITIONS=97} [2024-11-17 03:44:02,740 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 58 predicate places. [2024-11-17 03:44:02,741 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 97 transitions, 643 flow [2024-11-17 03:44:02,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 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-17 03:44:02,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:44:02,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:44:02,746 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 (14)] Ended with exit code 0 [2024-11-17 03:44:02,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-17 03:44:02,942 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:44:02,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:44:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1169418870, now seen corresponding path program 4 times [2024-11-17 03:44:02,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:44:02,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380298460] [2024-11-17 03:44:02,943 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 03:44:02,943 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-17 03:44:02,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:44:02,946 INFO L229 MonitoredProcess]: Starting monitored process 15 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-17 03:44:02,947 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 (15)] Waiting until timeout for monitored process [2024-11-17 03:44:03,102 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 03:44:03,102 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:44:03,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 03:44:03,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:44:03,273 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 12 treesize of output 8 [2024-11-17 03:44:03,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-17 03:44:03,485 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-17 03:44:03,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:44:03,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:44:03,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380298460] [2024-11-17 03:44:03,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380298460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:44:03,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:44:03,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:44:03,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452148058] [2024-11-17 03:44:03,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:44:03,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:44:03,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:44:03,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:44:03,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:44:03,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2024-11-17 03:44:03,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 97 transitions, 643 flow. Second operand has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 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-17 03:44:03,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:44:03,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2024-11-17 03:44:03,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:44:04,585 INFO L124 PetriNetUnfolderBase]: 2075/4505 cut-off events. [2024-11-17 03:44:04,586 INFO L125 PetriNetUnfolderBase]: For 9922/9947 co-relation queries the response was YES. [2024-11-17 03:44:04,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13352 conditions, 4505 events. 2075/4505 cut-off events. For 9922/9947 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 28281 event pairs, 502 based on Foata normal form. 21/4473 useless extension candidates. Maximal degree in co-relation 13311. Up to 1632 conditions per place. [2024-11-17 03:44:04,615 INFO L140 encePairwiseOnDemand]: 52/64 looper letters, 124 selfloop transitions, 52 changer transitions 0/195 dead transitions. [2024-11-17 03:44:04,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 195 transitions, 1417 flow [2024-11-17 03:44:04,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 03:44:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-17 03:44:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 449 transitions. [2024-11-17 03:44:04,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5011160714285714 [2024-11-17 03:44:04,618 INFO L175 Difference]: Start difference. First operand has 114 places, 97 transitions, 643 flow. Second operand 14 states and 449 transitions. [2024-11-17 03:44:04,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 195 transitions, 1417 flow [2024-11-17 03:44:04,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 195 transitions, 1371 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-11-17 03:44:04,641 INFO L231 Difference]: Finished difference. Result has 131 places, 106 transitions, 861 flow [2024-11-17 03:44:04,642 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=861, PETRI_PLACES=131, PETRI_TRANSITIONS=106} [2024-11-17 03:44:04,642 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 75 predicate places. [2024-11-17 03:44:04,642 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 106 transitions, 861 flow [2024-11-17 03:44:04,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 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-17 03:44:04,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:44:04,643 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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-17 03:44:04,650 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 (15)] Ended with exit code 0 [2024-11-17 03:44:04,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-17 03:44:04,843 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-17 03:44:04,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:44:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 250497023, now seen corresponding path program 1 times [2024-11-17 03:44:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:44:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85469578] [2024-11-17 03:44:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:44:04,844 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-17 03:44:04,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:44:04,846 INFO L229 MonitoredProcess]: Starting monitored process 16 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-17 03:44:04,847 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 (16)] Waiting until timeout for monitored process [2024-11-17 03:44:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:44:04,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:44:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:44:05,094 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 03:44:05,095 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:44:05,096 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-11-17 03:44:05,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-11-17 03:44:05,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-11-17 03:44:05,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-11-17 03:44:05,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-17 03:44:05,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-17 03:44:05,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-11-17 03:44:05,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-17 03:44:05,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-17 03:44:05,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-11-17 03:44:05,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-17 03:44:05,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-17 03:44:05,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-11-17 03:44:05,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-17 03:44:05,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-11-17 03:44:05,109 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 (16)] Ended with exit code 0 [2024-11-17 03:44:05,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-17 03:44:05,302 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:44:05,356 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:44:05,356 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:44:05,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:44:05 BasicIcfg [2024-11-17 03:44:05,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:44:05,363 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:44:05,363 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:44:05,364 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:44:05,364 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:43:49" (3/4) ... [2024-11-17 03:44:05,366 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:44:05,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:44:05,368 INFO L158 Benchmark]: Toolchain (without parser) took 17765.05ms. Allocated memory was 62.9MB in the beginning and 323.0MB in the end (delta: 260.0MB). Free memory was 24.0MB in the beginning and 97.5MB in the end (delta: -73.5MB). Peak memory consumption was 189.3MB. Max. memory is 16.1GB. [2024-11-17 03:44:05,368 INFO L158 Benchmark]: CDTParser took 4.78ms. Allocated memory was 44.0MB in the beginning and 62.9MB in the end (delta: 18.9MB). Free memory was 19.9MB in the beginning and 47.4MB in the end (delta: -27.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:44:05,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.21ms. Allocated memory is still 62.9MB. Free memory was 23.8MB in the beginning and 20.9MB in the end (delta: 2.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-17 03:44:05,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.99ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 20.9MB in the beginning and 53.9MB in the end (delta: -33.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-11-17 03:44:05,369 INFO L158 Benchmark]: Boogie Preprocessor took 73.97ms. Allocated memory is still 77.6MB. Free memory was 53.9MB in the beginning and 51.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:44:05,370 INFO L158 Benchmark]: IcfgBuilder took 851.20ms. Allocated memory is still 77.6MB. Free memory was 51.0MB in the beginning and 45.0MB in the end (delta: 6.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-17 03:44:05,370 INFO L158 Benchmark]: TraceAbstraction took 16178.47ms. Allocated memory was 77.6MB in the beginning and 323.0MB in the end (delta: 245.4MB). Free memory was 44.5MB in the beginning and 97.5MB in the end (delta: -53.0MB). Peak memory consumption was 192.7MB. Max. memory is 16.1GB. [2024-11-17 03:44:05,370 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 323.0MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:44:05,371 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.78ms. Allocated memory was 44.0MB in the beginning and 62.9MB in the end (delta: 18.9MB). Free memory was 19.9MB in the beginning and 47.4MB in the end (delta: -27.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.21ms. Allocated memory is still 62.9MB. Free memory was 23.8MB in the beginning and 20.9MB in the end (delta: 2.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.99ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 20.9MB in the beginning and 53.9MB in the end (delta: -33.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.97ms. Allocated memory is still 77.6MB. Free memory was 53.9MB in the beginning and 51.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 851.20ms. Allocated memory is still 77.6MB. Free memory was 51.0MB in the beginning and 45.0MB in the end (delta: 6.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16178.47ms. Allocated memory was 77.6MB in the beginning and 323.0MB in the end (delta: 245.4MB). Free memory was 44.5MB in the beginning and 97.5MB in the end (delta: -53.0MB). Peak memory consumption was 192.7MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 323.0MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 681. Possible FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] CALL 2 reach_error() [L681] COND FALSE 2 !(0) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L681] 2 __assert_fail ("0", "", 0, __extension__ __PRETTY_FUNCTION__) VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 754]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: 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: 762]: 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 681]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 97 locations, 15 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: 16.0s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 991 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 872 mSDsluCounter, 643 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 608 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3924 IncrementalHoareTripleChecker+Invalid, 3951 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 35 mSDtfsCounter, 3924 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=861occurred in iteration=14, InterpolantAutomatonStates: 80, 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.8s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 2651 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1454 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 9/9 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-17 03:44:05,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample