./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/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-dev-4a390ef-m [2024-10-24 19:28:05,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:28:05,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 19:28:05,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:28:05,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:28:05,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:28:05,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:28:05,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:28:05,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:28:05,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:28:05,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:28:05,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:28:05,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:28:05,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:28:05,793 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:28:05,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:28:05,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:28:05,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:28:05,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:28:05,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:28:05,796 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:28:05,799 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:28:05,799 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:28:05,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:28:05,799 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:28:05,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:28:05,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:28:05,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:28:05,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:28:05,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:28:05,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:28:05,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:28:05,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:28:05,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:28:05,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:28:05,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:28:05,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:28:05,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:28:05,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:28:05,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:28:05,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:28:05,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:28:05,803 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-10-24 19:28:05,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:28:06,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:28:06,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:28:06,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:28:06,023 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:28:06,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-10-24 19:28:07,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:28:07,546 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:28:07,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-10-24 19:28:07,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9faea7dc2/ab8ff8bdb3a342babf153d1415ecfd12/FLAGc6ba7002d [2024-10-24 19:28:07,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9faea7dc2/ab8ff8bdb3a342babf153d1415ecfd12 [2024-10-24 19:28:07,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:28:07,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:28:07,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:28:07,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:28:07,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:28:07,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:28:07" (1/1) ... [2024-10-24 19:28:07,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c499fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:07, skipping insertion in model container [2024-10-24 19:28:07,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:28:07" (1/1) ... [2024-10-24 19:28:07,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:28:07,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:28:07,992 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:28:08,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:28:08,078 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:28:08,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08 WrapperNode [2024-10-24 19:28:08,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:28:08,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:28:08,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:28:08,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:28:08,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,132 INFO L138 Inliner]: procedures = 168, calls = 30, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2024-10-24 19:28:08,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:28:08,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:28:08,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:28:08,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:28:08,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,158 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 1, 3, 8]. 57 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 8]. The 2 writes are split as follows [0, 0, 2, 0]. [2024-10-24 19:28:08,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:28:08,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:28:08,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:28:08,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:28:08,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (1/1) ... [2024-10-24 19:28:08,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:28:08,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:28:08,213 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-10-24 19:28:08,215 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-10-24 19:28:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 19:28:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 19:28:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 19:28:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 19:28:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-24 19:28:08,247 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-24 19:28:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-24 19:28:08,247 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-24 19:28:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 19:28:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 19:28:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:28:08,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:28:08,250 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:28:08,365 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:28:08,367 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:28:08,585 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:28:08,585 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:28:08,719 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:28:08,720 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 19:28:08,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:28:08 BoogieIcfgContainer [2024-10-24 19:28:08,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:28:08,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:28:08,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:28:08,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:28:08,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:28:07" (1/3) ... [2024-10-24 19:28:08,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:28:08, skipping insertion in model container [2024-10-24 19:28:08,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:08" (2/3) ... [2024-10-24 19:28:08,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:28:08, skipping insertion in model container [2024-10-24 19:28:08,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:28:08" (3/3) ... [2024-10-24 19:28:08,730 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-10-24 19:28:08,744 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:28:08,744 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-24 19:28:08,744 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:28:08,812 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-24 19:28:08,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2024-10-24 19:28:08,883 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2024-10-24 19:28:08,883 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 19:28:08,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 149 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2024-10-24 19:28:08,887 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2024-10-24 19:28:08,890 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2024-10-24 19:28:08,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:28:08,907 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;@c97f71f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:28:08,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-24 19:28:08,914 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:28:08,914 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-10-24 19:28:08,914 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 19:28:08,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:08,915 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:08,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:08,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:08,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1496600493, now seen corresponding path program 1 times [2024-10-24 19:28:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:08,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752296197] [2024-10-24 19:28:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:09,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752296197] [2024-10-24 19:28:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752296197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:09,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:09,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:28:09,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695725210] [2024-10-24 19:28:09,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:09,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:09,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:09,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:09,287 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-10-24 19:28:09,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-10-24 19:28:09,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:09,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-10-24 19:28:09,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:09,458 INFO L124 PetriNetUnfolderBase]: 445/831 cut-off events. [2024-10-24 19:28:09,458 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-24 19:28:09,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 831 events. 445/831 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4293 event pairs, 330 based on Foata normal form. 90/846 useless extension candidates. Maximal degree in co-relation 1498. Up to 710 conditions per place. [2024-10-24 19:28:09,468 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-10-24 19:28:09,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2024-10-24 19:28:09,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-24 19:28:09,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-10-24 19:28:09,483 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2024-10-24 19:28:09,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2024-10-24 19:28:09,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:28:09,492 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2024-10-24 19:28:09,495 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2024-10-24 19:28:09,498 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-10-24 19:28:09,499 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2024-10-24 19:28:09,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-10-24 19:28:09,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:09,499 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:09,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:28:09,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:09,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1496600492, now seen corresponding path program 1 times [2024-10-24 19:28:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:09,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929608548] [2024-10-24 19:28:09,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:09,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929608548] [2024-10-24 19:28:09,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929608548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:09,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:09,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:28:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798124157] [2024-10-24 19:28:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:09,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:09,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:09,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:09,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-24 19:28:09,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-10-24 19:28:09,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:09,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-24 19:28:09,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:09,920 INFO L124 PetriNetUnfolderBase]: 788/1475 cut-off events. [2024-10-24 19:28:09,921 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-24 19:28:09,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1475 events. 788/1475 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7768 event pairs, 263 based on Foata normal form. 0/1363 useless extension candidates. Maximal degree in co-relation 2704. Up to 697 conditions per place. [2024-10-24 19:28:09,933 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-10-24 19:28:09,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2024-10-24 19:28:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-10-24 19:28:09,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-10-24 19:28:09,936 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2024-10-24 19:28:09,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2024-10-24 19:28:09,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:09,957 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2024-10-24 19:28:09,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-10-24 19:28:09,960 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-10-24 19:28:09,960 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2024-10-24 19:28:09,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-10-24 19:28:09,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:09,961 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:09,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 19:28:09,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:09,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:09,961 INFO L85 PathProgramCache]: Analyzing trace with hash 830663735, now seen corresponding path program 1 times [2024-10-24 19:28:09,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:09,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980335358] [2024-10-24 19:28:09,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:09,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:10,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:10,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980335358] [2024-10-24 19:28:10,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980335358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:10,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:10,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:28:10,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89488381] [2024-10-24 19:28:10,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:10,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:28:10,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:10,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:28:10,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:28:10,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-10-24 19:28:10,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-10-24 19:28:10,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:10,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-10-24 19:28:10,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:10,270 INFO L124 PetriNetUnfolderBase]: 831/1494 cut-off events. [2024-10-24 19:28:10,271 INFO L125 PetriNetUnfolderBase]: For 51/61 co-relation queries the response was YES. [2024-10-24 19:28:10,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 1494 events. 831/1494 cut-off events. For 51/61 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7626 event pairs, 619 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 2920. Up to 1298 conditions per place. [2024-10-24 19:28:10,278 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 31 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-10-24 19:28:10,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 171 flow [2024-10-24 19:28:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-10-24 19:28:10,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2024-10-24 19:28:10,282 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 3 states and 89 transitions. [2024-10-24 19:28:10,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 171 flow [2024-10-24 19:28:10,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:10,285 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 107 flow [2024-10-24 19:28:10,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-10-24 19:28:10,286 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-10-24 19:28:10,286 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 107 flow [2024-10-24 19:28:10,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-10-24 19:28:10,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:10,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:10,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:28:10,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:10,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:10,289 INFO L85 PathProgramCache]: Analyzing trace with hash 542347981, now seen corresponding path program 1 times [2024-10-24 19:28:10,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:10,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518201648] [2024-10-24 19:28:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:10,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:10,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:10,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518201648] [2024-10-24 19:28:10,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518201648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:10,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:10,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:10,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213724955] [2024-10-24 19:28:10,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:10,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:10,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:10,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:10,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:10,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:10,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-24 19:28:10,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:10,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:10,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:10,503 INFO L124 PetriNetUnfolderBase]: 1091/1969 cut-off events. [2024-10-24 19:28:10,503 INFO L125 PetriNetUnfolderBase]: For 98/118 co-relation queries the response was YES. [2024-10-24 19:28:10,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3812 conditions, 1969 events. 1091/1969 cut-off events. For 98/118 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11226 event pairs, 517 based on Foata normal form. 24/1879 useless extension candidates. Maximal degree in co-relation 3803. Up to 1179 conditions per place. [2024-10-24 19:28:10,515 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 51 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-10-24 19:28:10,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 264 flow [2024-10-24 19:28:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-10-24 19:28:10,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-24 19:28:10,518 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 107 flow. Second operand 3 states and 116 transitions. [2024-10-24 19:28:10,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 264 flow [2024-10-24 19:28:10,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:10,521 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 118 flow [2024-10-24 19:28:10,521 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-10-24 19:28:10,522 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-10-24 19:28:10,522 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 118 flow [2024-10-24 19:28:10,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-24 19:28:10,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:10,523 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:10,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 19:28:10,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:10,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -968379012, now seen corresponding path program 1 times [2024-10-24 19:28:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53618564] [2024-10-24 19:28:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:10,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:10,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53618564] [2024-10-24 19:28:10,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53618564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:10,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:10,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:28:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552190567] [2024-10-24 19:28:10,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:10,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:10,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:10,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:10,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:10,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:10,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-10-24 19:28:10,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:10,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:10,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:10,833 INFO L124 PetriNetUnfolderBase]: 1302/2456 cut-off events. [2024-10-24 19:28:10,833 INFO L125 PetriNetUnfolderBase]: For 238/254 co-relation queries the response was YES. [2024-10-24 19:28:10,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4942 conditions, 2456 events. 1302/2456 cut-off events. For 238/254 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 14213 event pairs, 482 based on Foata normal form. 41/2430 useless extension candidates. Maximal degree in co-relation 4932. Up to 1291 conditions per place. [2024-10-24 19:28:10,847 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 48 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-10-24 19:28:10,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 274 flow [2024-10-24 19:28:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-10-24 19:28:10,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-10-24 19:28:10,849 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 118 flow. Second operand 3 states and 111 transitions. [2024-10-24 19:28:10,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 274 flow [2024-10-24 19:28:10,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:10,852 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 131 flow [2024-10-24 19:28:10,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-10-24 19:28:10,852 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-10-24 19:28:10,853 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 131 flow [2024-10-24 19:28:10,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-10-24 19:28:10,853 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:10,853 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:10,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 19:28:10,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:10,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -187713965, now seen corresponding path program 1 times [2024-10-24 19:28:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033355672] [2024-10-24 19:28:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:10,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:10,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033355672] [2024-10-24 19:28:10,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033355672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:10,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:10,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:10,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930965165] [2024-10-24 19:28:10,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:10,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:10,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:10,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:10,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:10,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:10,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:10,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:10,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:10,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:11,179 INFO L124 PetriNetUnfolderBase]: 2134/4056 cut-off events. [2024-10-24 19:28:11,179 INFO L125 PetriNetUnfolderBase]: For 732/764 co-relation queries the response was YES. [2024-10-24 19:28:11,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8472 conditions, 4056 events. 2134/4056 cut-off events. For 732/764 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 26301 event pairs, 979 based on Foata normal form. 69/3997 useless extension candidates. Maximal degree in co-relation 8460. Up to 2082 conditions per place. [2024-10-24 19:28:11,203 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 55 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-10-24 19:28:11,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 320 flow [2024-10-24 19:28:11,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-10-24 19:28:11,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2024-10-24 19:28:11,204 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 131 flow. Second operand 3 states and 115 transitions. [2024-10-24 19:28:11,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 320 flow [2024-10-24 19:28:11,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:11,208 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 140 flow [2024-10-24 19:28:11,209 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-10-24 19:28:11,210 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-10-24 19:28:11,210 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 140 flow [2024-10-24 19:28:11,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:11,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:11,211 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:11,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:28:11,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:11,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash -130836740, now seen corresponding path program 1 times [2024-10-24 19:28:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:11,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126882160] [2024-10-24 19:28:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:11,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:11,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:11,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126882160] [2024-10-24 19:28:11,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126882160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:11,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:11,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:11,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484300990] [2024-10-24 19:28:11,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:11,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:11,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:11,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:11,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:11,287 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:11,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-24 19:28:11,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:11,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:11,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:11,522 INFO L124 PetriNetUnfolderBase]: 1676/3241 cut-off events. [2024-10-24 19:28:11,522 INFO L125 PetriNetUnfolderBase]: For 679/685 co-relation queries the response was YES. [2024-10-24 19:28:11,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6997 conditions, 3241 events. 1676/3241 cut-off events. For 679/685 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 20292 event pairs, 743 based on Foata normal form. 86/3249 useless extension candidates. Maximal degree in co-relation 6984. Up to 1575 conditions per place. [2024-10-24 19:28:11,541 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 46 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-10-24 19:28:11,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 283 flow [2024-10-24 19:28:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-24 19:28:11,543 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2024-10-24 19:28:11,543 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 140 flow. Second operand 3 states and 107 transitions. [2024-10-24 19:28:11,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 283 flow [2024-10-24 19:28:11,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:28:11,546 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 139 flow [2024-10-24 19:28:11,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-10-24 19:28:11,548 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-10-24 19:28:11,549 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 139 flow [2024-10-24 19:28:11,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-24 19:28:11,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:11,549 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] [2024-10-24 19:28:11,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 19:28:11,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:11,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:11,550 INFO L85 PathProgramCache]: Analyzing trace with hash -143150347, now seen corresponding path program 1 times [2024-10-24 19:28:11,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:11,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033312914] [2024-10-24 19:28:11,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:11,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:11,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033312914] [2024-10-24 19:28:11,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033312914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:11,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:11,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:11,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229130945] [2024-10-24 19:28:11,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:11,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:11,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:11,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:11,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:11,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:11,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:11,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:11,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:11,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:11,801 INFO L124 PetriNetUnfolderBase]: 1070/2324 cut-off events. [2024-10-24 19:28:11,802 INFO L125 PetriNetUnfolderBase]: For 786/786 co-relation queries the response was YES. [2024-10-24 19:28:11,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5098 conditions, 2324 events. 1070/2324 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14033 event pairs, 335 based on Foata normal form. 126/2408 useless extension candidates. Maximal degree in co-relation 5085. Up to 1144 conditions per place. [2024-10-24 19:28:11,811 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-10-24 19:28:11,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 269 flow [2024-10-24 19:28:11,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-10-24 19:28:11,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-10-24 19:28:11,813 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 139 flow. Second operand 3 states and 104 transitions. [2024-10-24 19:28:11,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 269 flow [2024-10-24 19:28:11,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:28:11,817 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 143 flow [2024-10-24 19:28:11,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-10-24 19:28:11,818 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-10-24 19:28:11,818 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 143 flow [2024-10-24 19:28:11,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:11,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:11,818 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] [2024-10-24 19:28:11,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 19:28:11,818 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:11,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:11,818 INFO L85 PathProgramCache]: Analyzing trace with hash -45486984, now seen corresponding path program 1 times [2024-10-24 19:28:11,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:11,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160023422] [2024-10-24 19:28:11,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:11,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:11,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:11,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160023422] [2024-10-24 19:28:11,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160023422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:11,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922091348] [2024-10-24 19:28:11,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:11,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:28:11,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:28:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:28:12,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-24 19:28:12,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-10-24 19:28:12,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:12,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-24 19:28:12,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:12,363 INFO L124 PetriNetUnfolderBase]: 1595/3346 cut-off events. [2024-10-24 19:28:12,363 INFO L125 PetriNetUnfolderBase]: For 1238/1240 co-relation queries the response was YES. [2024-10-24 19:28:12,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 3346 events. 1595/3346 cut-off events. For 1238/1240 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19414 event pairs, 652 based on Foata normal form. 0/3248 useless extension candidates. Maximal degree in co-relation 7745. Up to 979 conditions per place. [2024-10-24 19:28:12,381 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 101 selfloop transitions, 4 changer transitions 0/119 dead transitions. [2024-10-24 19:28:12,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 119 transitions, 594 flow [2024-10-24 19:28:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:28:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:28:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2024-10-24 19:28:12,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2024-10-24 19:28:12,383 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 143 flow. Second operand 5 states and 200 transitions. [2024-10-24 19:28:12,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 119 transitions, 594 flow [2024-10-24 19:28:12,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 119 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:12,387 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 161 flow [2024-10-24 19:28:12,387 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-10-24 19:28:12,387 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-10-24 19:28:12,388 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 161 flow [2024-10-24 19:28:12,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-10-24 19:28:12,388 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:12,388 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] [2024-10-24 19:28:12,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 19:28:12,388 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:12,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1273294062, now seen corresponding path program 1 times [2024-10-24 19:28:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:12,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608123793] [2024-10-24 19:28:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:12,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608123793] [2024-10-24 19:28:12,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608123793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:12,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:12,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:28:12,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371577703] [2024-10-24 19:28:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:12,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:12,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:12,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:12,488 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:12,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 161 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-10-24 19:28:12,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:12,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:12,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:12,675 INFO L124 PetriNetUnfolderBase]: 1237/2618 cut-off events. [2024-10-24 19:28:12,676 INFO L125 PetriNetUnfolderBase]: For 1018/1024 co-relation queries the response was YES. [2024-10-24 19:28:12,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5988 conditions, 2618 events. 1237/2618 cut-off events. For 1018/1024 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14360 event pairs, 516 based on Foata normal form. 28/2572 useless extension candidates. Maximal degree in co-relation 5972. Up to 1667 conditions per place. [2024-10-24 19:28:12,687 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 49 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-10-24 19:28:12,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 320 flow [2024-10-24 19:28:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-10-24 19:28:12,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2024-10-24 19:28:12,689 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 161 flow. Second operand 3 states and 109 transitions. [2024-10-24 19:28:12,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 320 flow [2024-10-24 19:28:12,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 312 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:12,692 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 161 flow [2024-10-24 19:28:12,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-10-24 19:28:12,693 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-10-24 19:28:12,694 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 161 flow [2024-10-24 19:28:12,695 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-10-24 19:28:12,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:12,695 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:12,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 19:28:12,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:12,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:12,696 INFO L85 PathProgramCache]: Analyzing trace with hash 941449363, now seen corresponding path program 1 times [2024-10-24 19:28:12,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:12,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773923173] [2024-10-24 19:28:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:12,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773923173] [2024-10-24 19:28:12,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773923173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:28:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624467724] [2024-10-24 19:28:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:12,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:28:12,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:28:12,745 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-10-24 19:28:12,750 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-10-24 19:28:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:12,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:28:12,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 19:28:12,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:12,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624467724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:12,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:28:12,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2024-10-24 19:28:12,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499798894] [2024-10-24 19:28:12,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:12,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:12,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:12,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:12,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:28:12,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-24 19:28:12,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-10-24 19:28:12,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:12,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-24 19:28:12,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:13,093 INFO L124 PetriNetUnfolderBase]: 1237/2597 cut-off events. [2024-10-24 19:28:13,094 INFO L125 PetriNetUnfolderBase]: For 967/973 co-relation queries the response was YES. [2024-10-24 19:28:13,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6029 conditions, 2597 events. 1237/2597 cut-off events. For 967/973 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14382 event pairs, 975 based on Foata normal form. 7/2522 useless extension candidates. Maximal degree in co-relation 6011. Up to 2069 conditions per place. [2024-10-24 19:28:13,102 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 32 selfloop transitions, 1 changer transitions 2/48 dead transitions. [2024-10-24 19:28:13,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 227 flow [2024-10-24 19:28:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-10-24 19:28:13,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2024-10-24 19:28:13,104 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 161 flow. Second operand 3 states and 90 transitions. [2024-10-24 19:28:13,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 227 flow [2024-10-24 19:28:13,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:28:13,106 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 152 flow [2024-10-24 19:28:13,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-10-24 19:28:13,106 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-10-24 19:28:13,107 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 152 flow [2024-10-24 19:28:13,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-10-24 19:28:13,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:13,107 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:13,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 19:28:13,307 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-10-24 19:28:13,308 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:13,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2003072378, now seen corresponding path program 1 times [2024-10-24 19:28:13,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:13,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109793046] [2024-10-24 19:28:13,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 19:28:13,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735890162] [2024-10-24 19:28:13,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:13,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:28:13,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:28:13,332 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-10-24 19:28:13,336 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-10-24 19:28:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:13,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 19:28:13,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:13,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:13,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:13,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109793046] [2024-10-24 19:28:13,611 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 19:28:13,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735890162] [2024-10-24 19:28:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735890162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:13,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:13,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818211551] [2024-10-24 19:28:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:13,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:28:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:13,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:28:13,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:28:13,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:13,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:13,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:13,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:13,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:13,809 INFO L124 PetriNetUnfolderBase]: 1008/2164 cut-off events. [2024-10-24 19:28:13,810 INFO L125 PetriNetUnfolderBase]: For 775/777 co-relation queries the response was YES. [2024-10-24 19:28:13,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 2164 events. 1008/2164 cut-off events. For 775/777 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 11083 event pairs, 348 based on Foata normal form. 18/2132 useless extension candidates. Maximal degree in co-relation 4961. Up to 900 conditions per place. [2024-10-24 19:28:13,837 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 57 selfloop transitions, 3 changer transitions 3/76 dead transitions. [2024-10-24 19:28:13,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 381 flow [2024-10-24 19:28:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:28:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:28:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-10-24 19:28:13,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6077586206896551 [2024-10-24 19:28:13,839 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 152 flow. Second operand 4 states and 141 transitions. [2024-10-24 19:28:13,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 381 flow [2024-10-24 19:28:13,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:13,841 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 161 flow [2024-10-24 19:28:13,842 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-10-24 19:28:13,842 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-10-24 19:28:13,842 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 161 flow [2024-10-24 19:28:13,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:13,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:13,842 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:13,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 19:28:14,043 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,SelfDestructingSolverStorable11 [2024-10-24 19:28:14,043 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:14,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:14,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1298877855, now seen corresponding path program 1 times [2024-10-24 19:28:14,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:14,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485931359] [2024-10-24 19:28:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:14,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485931359] [2024-10-24 19:28:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485931359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:14,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 19:28:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321108268] [2024-10-24 19:28:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:14,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:28:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:14,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:28:14,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:28:14,549 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:14,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 161 flow. Second operand has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 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-10-24 19:28:14,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:14,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:14,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:15,157 INFO L124 PetriNetUnfolderBase]: 1608/3383 cut-off events. [2024-10-24 19:28:15,157 INFO L125 PetriNetUnfolderBase]: For 1485/1491 co-relation queries the response was YES. [2024-10-24 19:28:15,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7922 conditions, 3383 events. 1608/3383 cut-off events. For 1485/1491 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 19149 event pairs, 559 based on Foata normal form. 0/3305 useless extension candidates. Maximal degree in co-relation 7902. Up to 1088 conditions per place. [2024-10-24 19:28:15,172 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 121 selfloop transitions, 30 changer transitions 1/165 dead transitions. [2024-10-24 19:28:15,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 165 transitions, 887 flow [2024-10-24 19:28:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 19:28:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 19:28:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 421 transitions. [2024-10-24 19:28:15,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5583554376657824 [2024-10-24 19:28:15,174 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 161 flow. Second operand 13 states and 421 transitions. [2024-10-24 19:28:15,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 165 transitions, 887 flow [2024-10-24 19:28:15,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 165 transitions, 867 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:28:15,178 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 404 flow [2024-10-24 19:28:15,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=404, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2024-10-24 19:28:15,179 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2024-10-24 19:28:15,179 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 404 flow [2024-10-24 19:28:15,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 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-10-24 19:28:15,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:15,180 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] [2024-10-24 19:28:15,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 19:28:15,180 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:15,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1954093123, now seen corresponding path program 1 times [2024-10-24 19:28:15,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:15,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906939250] [2024-10-24 19:28:15,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:15,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:15,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:28:15,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906939250] [2024-10-24 19:28:15,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906939250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:15,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:15,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:15,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47535727] [2024-10-24 19:28:15,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:15,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:15,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:28:15,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:15,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:15,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-24 19:28:15,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:15,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:15,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-24 19:28:15,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:15,487 INFO L124 PetriNetUnfolderBase]: 1601/3288 cut-off events. [2024-10-24 19:28:15,487 INFO L125 PetriNetUnfolderBase]: For 2968/2976 co-relation queries the response was YES. [2024-10-24 19:28:15,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8653 conditions, 3288 events. 1601/3288 cut-off events. For 2968/2976 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 18174 event pairs, 423 based on Foata normal form. 40/3260 useless extension candidates. Maximal degree in co-relation 8623. Up to 1984 conditions per place. [2024-10-24 19:28:15,500 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 70 selfloop transitions, 4 changer transitions 3/89 dead transitions. [2024-10-24 19:28:15,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 89 transitions, 625 flow [2024-10-24 19:28:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:15,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-10-24 19:28:15,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2024-10-24 19:28:15,502 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 404 flow. Second operand 3 states and 103 transitions. [2024-10-24 19:28:15,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 89 transitions, 625 flow [2024-10-24 19:28:15,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 89 transitions, 600 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-24 19:28:15,507 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 375 flow [2024-10-24 19:28:15,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-10-24 19:28:15,508 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2024-10-24 19:28:15,508 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 375 flow [2024-10-24 19:28:15,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:15,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:15,509 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-24 19:28:15,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 19:28:15,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:15,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash -714626073, now seen corresponding path program 1 times [2024-10-24 19:28:15,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:28:15,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398256158] [2024-10-24 19:28:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:28:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 19:28:15,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593960143] [2024-10-24 19:28:15,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:15,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:28:15,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:28:15,548 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-10-24 19:28:15,549 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-10-24 19:28:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:28:15,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:28:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:28:15,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 19:28:15,684 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:28:15,685 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-10-24 19:28:15,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-10-24 19:28:15,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-10-24 19:28:15,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-10-24 19:28:15,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 19:28:15,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:28:15,892 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:15,941 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 19:28:15,941 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:28:15,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:28:15 BasicIcfg [2024-10-24 19:28:15,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:28:15,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:28:15,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:28:15,949 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:28:15,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:28:08" (3/4) ... [2024-10-24 19:28:15,951 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 19:28:15,952 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:28:15,953 INFO L158 Benchmark]: Toolchain (without parser) took 8369.23ms. Allocated memory was 161.5MB in the beginning and 381.7MB in the end (delta: 220.2MB). Free memory was 96.0MB in the beginning and 226.4MB in the end (delta: -130.3MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. [2024-10-24 19:28:15,953 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:28:15,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.31ms. Allocated memory is still 161.5MB. Free memory was 95.7MB in the beginning and 122.3MB in the end (delta: -26.6MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-10-24 19:28:15,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.07ms. Allocated memory is still 161.5MB. Free memory was 122.3MB in the beginning and 120.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:28:15,954 INFO L158 Benchmark]: Boogie Preprocessor took 51.53ms. Allocated memory is still 161.5MB. Free memory was 120.1MB in the beginning and 116.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:28:15,954 INFO L158 Benchmark]: RCFGBuilder took 535.36ms. Allocated memory is still 161.5MB. Free memory was 116.7MB in the beginning and 79.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-24 19:28:15,954 INFO L158 Benchmark]: TraceAbstraction took 7227.18ms. Allocated memory was 161.5MB in the beginning and 381.7MB in the end (delta: 220.2MB). Free memory was 78.3MB in the beginning and 226.4MB in the end (delta: -148.0MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. [2024-10-24 19:28:15,954 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 381.7MB. Free memory is still 226.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:28:15,955 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.16ms. Allocated memory is still 96.5MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.31ms. Allocated memory is still 161.5MB. Free memory was 95.7MB in the beginning and 122.3MB in the end (delta: -26.6MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.07ms. Allocated memory is still 161.5MB. Free memory was 122.3MB in the beginning and 120.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.53ms. Allocated memory is still 161.5MB. Free memory was 120.1MB in the beginning and 116.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 535.36ms. Allocated memory is still 161.5MB. Free memory was 116.7MB in the beginning and 79.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7227.18ms. Allocated memory was 161.5MB in the beginning and 381.7MB in the end (delta: 220.2MB). Free memory was 78.3MB in the beginning and 226.4MB in the end (delta: -148.0MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 381.7MB. Free memory is still 226.4MB. 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]; [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, 89 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: 7.0s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 537 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1536 IncrementalHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 4 mSDtfsCounter, 1536 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=13, InterpolantAutomatonStates: 55, 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.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 15/16 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-10-24 19:28:15,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/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-dev-4a390ef-m [2024-10-24 19:28:17,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:28:18,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 19:28:18,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:28:18,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:28:18,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:28:18,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:28:18,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:28:18,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:28:18,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:28:18,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:28:18,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:28:18,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:28:18,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:28:18,084 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:28:18,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:28:18,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:28:18,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:28:18,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:28:18,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:28:18,088 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:28:18,089 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:28:18,090 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:28:18,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:28:18,090 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:28:18,090 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 19:28:18,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:28:18,090 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 19:28:18,091 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:28:18,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:28:18,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:28:18,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:28:18,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:28:18,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:28:18,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:28:18,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:28:18,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:28:18,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:28:18,094 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 19:28:18,094 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 19:28:18,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:28:18,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:28:18,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:28:18,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:28:18,094 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 19:28:18,095 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-10-24 19:28:18,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:28:18,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:28:18,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:28:18,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:28:18,411 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:28:18,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-10-24 19:28:19,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:28:19,936 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:28:19,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-10-24 19:28:19,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3bc8b410/83866c05ff894eb0b50dadaafc007196/FLAG0eb2b36bb [2024-10-24 19:28:19,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3bc8b410/83866c05ff894eb0b50dadaafc007196 [2024-10-24 19:28:19,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:28:19,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:28:19,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:28:19,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:28:19,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:28:19,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:28:19" (1/1) ... [2024-10-24 19:28:19,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175fdf5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:19, skipping insertion in model container [2024-10-24 19:28:19,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:28:19" (1/1) ... [2024-10-24 19:28:20,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:28:20,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:28:20,376 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:28:20,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:28:20,455 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:28:20,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20 WrapperNode [2024-10-24 19:28:20,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:28:20,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:28:20,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:28:20,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:28:20,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,508 INFO L138 Inliner]: procedures = 175, calls = 30, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 132 [2024-10-24 19:28:20,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:28:20,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:28:20,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:28:20,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:28:20,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,536 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 1, 3, 8]. 57 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 8]. The 2 writes are split as follows [0, 0, 2, 0]. [2024-10-24 19:28:20,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:28:20,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:28:20,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:28:20,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:28:20,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (1/1) ... [2024-10-24 19:28:20,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:28:20,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:28:20,585 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-10-24 19:28:20,588 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-10-24 19:28:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 19:28:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 19:28:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 19:28:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 19:28:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-24 19:28:20,621 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-24 19:28:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-24 19:28:20,621 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-24 19:28:20,621 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 19:28:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:28:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 19:28:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 19:28:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 19:28:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 19:28:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 19:28:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 19:28:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 19:28:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 19:28:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 19:28:20,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 19:28:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 19:28:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 19:28:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 19:28:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 19:28:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 19:28:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 19:28:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 19:28:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 19:28:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 19:28:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 19:28:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 19:28:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:28:20,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:28:20,625 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:28:20,805 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:28:20,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:28:21,120 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:28:21,120 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:28:21,305 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:28:21,306 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 19:28:21,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:28:21 BoogieIcfgContainer [2024-10-24 19:28:21,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:28:21,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:28:21,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:28:21,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:28:21,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:28:19" (1/3) ... [2024-10-24 19:28:21,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9560a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:28:21, skipping insertion in model container [2024-10-24 19:28:21,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:28:20" (2/3) ... [2024-10-24 19:28:21,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9560a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:28:21, skipping insertion in model container [2024-10-24 19:28:21,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:28:21" (3/3) ... [2024-10-24 19:28:21,315 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-10-24 19:28:21,331 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:28:21,331 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-24 19:28:21,331 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:28:21,379 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-24 19:28:21,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 58 transitions, 130 flow [2024-10-24 19:28:21,433 INFO L124 PetriNetUnfolderBase]: 10/56 cut-off events. [2024-10-24 19:28:21,433 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 19:28:21,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 56 events. 10/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 148 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2024-10-24 19:28:21,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 58 transitions, 130 flow [2024-10-24 19:28:21,444 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 55 transitions, 122 flow [2024-10-24 19:28:21,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:28:21,462 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;@27373929, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:28:21,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-24 19:28:21,469 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:28:21,469 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-10-24 19:28:21,469 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 19:28:21,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:21,470 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:21,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:21,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:21,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1773539155, now seen corresponding path program 1 times [2024-10-24 19:28:21,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391932635] [2024-10-24 19:28:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:21,490 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-10-24 19:28:21,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:21,491 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-10-24 19:28:21,492 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-10-24 19:28:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:21,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:28:21,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:21,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:21,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:21,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391932635] [2024-10-24 19:28:21,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391932635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:21,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:21,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:28:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250866418] [2024-10-24 19:28:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:21,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:21,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:21,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:21,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:21,754 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-10-24 19:28:21,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-10-24 19:28:21,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:21,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-10-24 19:28:21,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:21,972 INFO L124 PetriNetUnfolderBase]: 445/842 cut-off events. [2024-10-24 19:28:21,973 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-24 19:28:21,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1587 conditions, 842 events. 445/842 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4347 event pairs, 329 based on Foata normal form. 92/860 useless extension candidates. Maximal degree in co-relation 1505. Up to 708 conditions per place. [2024-10-24 19:28:21,983 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 29 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-10-24 19:28:21,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2024-10-24 19:28:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-24 19:28:21,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-10-24 19:28:21,996 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 122 flow. Second operand 3 states and 93 transitions. [2024-10-24 19:28:21,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2024-10-24 19:28:22,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:28:22,005 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 100 flow [2024-10-24 19:28:22,007 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2024-10-24 19:28:22,012 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-10-24 19:28:22,012 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 100 flow [2024-10-24 19:28:22,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-10-24 19:28:22,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:22,013 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:22,018 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-10-24 19:28:22,214 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-10-24 19:28:22,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:22,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1773539156, now seen corresponding path program 1 times [2024-10-24 19:28:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:22,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772165089] [2024-10-24 19:28:22,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:22,216 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-10-24 19:28:22,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:22,219 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-10-24 19:28:22,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 19:28:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:22,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:28:22,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:22,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:22,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:22,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772165089] [2024-10-24 19:28:22,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772165089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:22,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:22,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:28:22,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626354188] [2024-10-24 19:28:22,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:22,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:22,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:22,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:22,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-24 19:28:22,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-10-24 19:28:22,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:22,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-24 19:28:22,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:22,688 INFO L124 PetriNetUnfolderBase]: 787/1477 cut-off events. [2024-10-24 19:28:22,689 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-24 19:28:22,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 1477 events. 787/1477 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7761 event pairs, 262 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2703. Up to 697 conditions per place. [2024-10-24 19:28:22,702 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-10-24 19:28:22,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 261 flow [2024-10-24 19:28:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-10-24 19:28:22,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-10-24 19:28:22,705 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 100 flow. Second operand 3 states and 117 transitions. [2024-10-24 19:28:22,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 261 flow [2024-10-24 19:28:22,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:22,710 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 113 flow [2024-10-24 19:28:22,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-10-24 19:28:22,711 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2024-10-24 19:28:22,711 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 113 flow [2024-10-24 19:28:22,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-10-24 19:28:22,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:22,711 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:22,715 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-10-24 19:28:22,912 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-10-24 19:28:22,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:22,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1182259851, now seen corresponding path program 1 times [2024-10-24 19:28:22,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:22,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850535072] [2024-10-24 19:28:22,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:22,914 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-10-24 19:28:22,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:22,915 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-10-24 19:28:22,916 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-10-24 19:28:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:23,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 19:28:23,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:23,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:23,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:23,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850535072] [2024-10-24 19:28:23,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850535072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:23,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:23,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:23,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548931361] [2024-10-24 19:28:23,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:23,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:28:23,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:23,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:28:23,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:28:23,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:23,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-10-24 19:28:23,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:23,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:23,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:23,451 INFO L124 PetriNetUnfolderBase]: 986/1975 cut-off events. [2024-10-24 19:28:23,452 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-10-24 19:28:23,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 1975 events. 986/1975 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10812 event pairs, 195 based on Foata normal form. 75/1977 useless extension candidates. Maximal degree in co-relation 3684. Up to 626 conditions per place. [2024-10-24 19:28:23,460 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 74 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2024-10-24 19:28:23,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 369 flow [2024-10-24 19:28:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:28:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:28:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2024-10-24 19:28:23,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2024-10-24 19:28:23,462 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 113 flow. Second operand 4 states and 164 transitions. [2024-10-24 19:28:23,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 369 flow [2024-10-24 19:28:23,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:23,464 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 133 flow [2024-10-24 19:28:23,464 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-10-24 19:28:23,465 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-10-24 19:28:23,465 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 133 flow [2024-10-24 19:28:23,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-10-24 19:28:23,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:23,465 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:23,472 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-10-24 19:28:23,669 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-10-24 19:28:23,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:23,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:23,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1669714279, now seen corresponding path program 1 times [2024-10-24 19:28:23,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:23,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83903588] [2024-10-24 19:28:23,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:23,671 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-10-24 19:28:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:23,672 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-10-24 19:28:23,673 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-10-24 19:28:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:23,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:28:23,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:23,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:23,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83903588] [2024-10-24 19:28:23,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83903588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:23,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:23,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279030087] [2024-10-24 19:28:23,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:23,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:23,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:23,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:23,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:23,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:23,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-24 19:28:23,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:23,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:23,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:24,090 INFO L124 PetriNetUnfolderBase]: 1320/2518 cut-off events. [2024-10-24 19:28:24,091 INFO L125 PetriNetUnfolderBase]: For 527/545 co-relation queries the response was YES. [2024-10-24 19:28:24,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5044 conditions, 2518 events. 1320/2518 cut-off events. For 527/545 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 14706 event pairs, 796 based on Foata normal form. 22/2426 useless extension candidates. Maximal degree in co-relation 5033. Up to 1653 conditions per place. [2024-10-24 19:28:24,102 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-10-24 19:28:24,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 294 flow [2024-10-24 19:28:24,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-10-24 19:28:24,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-24 19:28:24,104 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 133 flow. Second operand 3 states and 116 transitions. [2024-10-24 19:28:24,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 294 flow [2024-10-24 19:28:24,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:28:24,106 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 141 flow [2024-10-24 19:28:24,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2024-10-24 19:28:24,107 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-10-24 19:28:24,107 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 141 flow [2024-10-24 19:28:24,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-24 19:28:24,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:24,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:24,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 19:28:24,308 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-10-24 19:28:24,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:24,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1642305274, now seen corresponding path program 1 times [2024-10-24 19:28:24,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:24,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181486696] [2024-10-24 19:28:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:24,310 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-10-24 19:28:24,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:24,312 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-10-24 19:28:24,313 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-10-24 19:28:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:24,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:28:24,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:24,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-10-24 19:28:24,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:24,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:24,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181486696] [2024-10-24 19:28:24,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181486696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:24,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:24,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:28:24,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859933450] [2024-10-24 19:28:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:24,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:24,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:24,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:24,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-24 19:28:24,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-10-24 19:28:24,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:24,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-24 19:28:24,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:24,689 INFO L124 PetriNetUnfolderBase]: 1343/2676 cut-off events. [2024-10-24 19:28:24,690 INFO L125 PetriNetUnfolderBase]: For 554/574 co-relation queries the response was YES. [2024-10-24 19:28:24,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5531 conditions, 2676 events. 1343/2676 cut-off events. For 554/574 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 15994 event pairs, 606 based on Foata normal form. 0/2575 useless extension candidates. Maximal degree in co-relation 5520. Up to 1181 conditions per place. [2024-10-24 19:28:24,704 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 52 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-10-24 19:28:24,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 321 flow [2024-10-24 19:28:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-10-24 19:28:24,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2024-10-24 19:28:24,706 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 141 flow. Second operand 3 states and 112 transitions. [2024-10-24 19:28:24,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 321 flow [2024-10-24 19:28:24,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:24,708 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 165 flow [2024-10-24 19:28:24,709 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=139, 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=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-10-24 19:28:24,709 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2024-10-24 19:28:24,710 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 165 flow [2024-10-24 19:28:24,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-10-24 19:28:24,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:24,710 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:24,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 19:28:24,913 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-10-24 19:28:24,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:24,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1969400921, now seen corresponding path program 1 times [2024-10-24 19:28:24,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:24,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003812652] [2024-10-24 19:28:24,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:24,915 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-10-24 19:28:24,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:24,917 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-10-24 19:28:24,918 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-10-24 19:28:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:24,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:28:24,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:24,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:25,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:25,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003812652] [2024-10-24 19:28:25,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003812652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:25,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:25,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:28:25,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162272077] [2024-10-24 19:28:25,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:25,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:25,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:25,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:25,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:25,003 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-24 19:28:25,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 165 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-10-24 19:28:25,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:25,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-24 19:28:25,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:25,296 INFO L124 PetriNetUnfolderBase]: 1397/2806 cut-off events. [2024-10-24 19:28:25,296 INFO L125 PetriNetUnfolderBase]: For 856/900 co-relation queries the response was YES. [2024-10-24 19:28:25,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6025 conditions, 2806 events. 1397/2806 cut-off events. For 856/900 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 17392 event pairs, 532 based on Foata normal form. 0/2669 useless extension candidates. Maximal degree in co-relation 6011. Up to 1632 conditions per place. [2024-10-24 19:28:25,308 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2024-10-24 19:28:25,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 346 flow [2024-10-24 19:28:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-10-24 19:28:25,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-10-24 19:28:25,309 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 165 flow. Second operand 3 states and 111 transitions. [2024-10-24 19:28:25,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 346 flow [2024-10-24 19:28:25,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:28:25,313 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 174 flow [2024-10-24 19:28:25,313 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=3, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-10-24 19:28:25,314 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-10-24 19:28:25,314 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 174 flow [2024-10-24 19:28:25,314 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-10-24 19:28:25,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:25,314 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:25,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 19:28:25,515 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-10-24 19:28:25,515 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:25,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1821568710, now seen corresponding path program 1 times [2024-10-24 19:28:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031010380] [2024-10-24 19:28:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:25,516 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-10-24 19:28:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:25,518 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-10-24 19:28:25,519 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-10-24 19:28:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:25,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:28:25,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:25,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:25,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031010380] [2024-10-24 19:28:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031010380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:25,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:25,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792223072] [2024-10-24 19:28:25,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:25,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:25,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:25,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:25,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-24 19:28:25,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-10-24 19:28:25,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:25,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-24 19:28:25,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:25,875 INFO L124 PetriNetUnfolderBase]: 1014/2032 cut-off events. [2024-10-24 19:28:25,875 INFO L125 PetriNetUnfolderBase]: For 564/576 co-relation queries the response was YES. [2024-10-24 19:28:25,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4365 conditions, 2032 events. 1014/2032 cut-off events. For 564/576 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10510 event pairs, 422 based on Foata normal form. 64/2045 useless extension candidates. Maximal degree in co-relation 4350. Up to 1083 conditions per place. [2024-10-24 19:28:25,884 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 47 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-10-24 19:28:25,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 301 flow [2024-10-24 19:28:25,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-10-24 19:28:25,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2024-10-24 19:28:25,886 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 174 flow. Second operand 3 states and 106 transitions. [2024-10-24 19:28:25,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 301 flow [2024-10-24 19:28:25,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 293 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-24 19:28:25,890 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 164 flow [2024-10-24 19:28:25,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=3, PETRI_FLOW=164, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-10-24 19:28:25,892 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-10-24 19:28:25,892 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 164 flow [2024-10-24 19:28:25,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-10-24 19:28:25,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:25,892 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] [2024-10-24 19:28:25,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 19:28:26,096 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-10-24 19:28:26,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:26,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:26,097 INFO L85 PathProgramCache]: Analyzing trace with hash 331766261, now seen corresponding path program 1 times [2024-10-24 19:28:26,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:26,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368122330] [2024-10-24 19:28:26,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:26,098 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-10-24 19:28:26,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:26,099 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-10-24 19:28:26,100 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-10-24 19:28:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:26,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:28:26,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:26,221 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-10-24 19:28:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:26,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:26,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:26,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368122330] [2024-10-24 19:28:26,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368122330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:26,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:26,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067928845] [2024-10-24 19:28:26,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:26,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:26,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:26,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:26,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:26,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:26,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:26,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:26,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:26,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:26,446 INFO L124 PetriNetUnfolderBase]: 619/1418 cut-off events. [2024-10-24 19:28:26,447 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2024-10-24 19:28:26,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2998 conditions, 1418 events. 619/1418 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6658 event pairs, 188 based on Foata normal form. 72/1454 useless extension candidates. Maximal degree in co-relation 2983. Up to 626 conditions per place. [2024-10-24 19:28:26,453 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2024-10-24 19:28:26,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 284 flow [2024-10-24 19:28:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-10-24 19:28:26,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2024-10-24 19:28:26,455 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 164 flow. Second operand 3 states and 105 transitions. [2024-10-24 19:28:26,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 284 flow [2024-10-24 19:28:26,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:28:26,458 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 168 flow [2024-10-24 19:28:26,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-10-24 19:28:26,459 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-10-24 19:28:26,459 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 168 flow [2024-10-24 19:28:26,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:26,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:26,459 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] [2024-10-24 19:28:26,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-24 19:28:26,660 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-10-24 19:28:26,660 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:26,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1341272330, now seen corresponding path program 1 times [2024-10-24 19:28:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:26,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488944748] [2024-10-24 19:28:26,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:26,661 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-10-24 19:28:26,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:26,663 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-10-24 19:28:26,664 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-10-24 19:28:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:26,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 19:28:26,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:27,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:27,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:27,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488944748] [2024-10-24 19:28:27,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488944748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:27,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:27,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:28:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306112527] [2024-10-24 19:28:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:27,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:28:27,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:27,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:28:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:28:27,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-24 19:28:27,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-10-24 19:28:27,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:27,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-24 19:28:27,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:27,367 INFO L124 PetriNetUnfolderBase]: 1216/2670 cut-off events. [2024-10-24 19:28:27,368 INFO L125 PetriNetUnfolderBase]: For 981/981 co-relation queries the response was YES. [2024-10-24 19:28:27,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6009 conditions, 2670 events. 1216/2670 cut-off events. For 981/981 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 14508 event pairs, 625 based on Foata normal form. 0/2570 useless extension candidates. Maximal degree in co-relation 5994. Up to 1000 conditions per place. [2024-10-24 19:28:27,380 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 80 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2024-10-24 19:28:27,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 510 flow [2024-10-24 19:28:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:28:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:28:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-10-24 19:28:27,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6853448275862069 [2024-10-24 19:28:27,382 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 168 flow. Second operand 4 states and 159 transitions. [2024-10-24 19:28:27,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 510 flow [2024-10-24 19:28:27,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 100 transitions, 498 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:27,385 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 180 flow [2024-10-24 19:28:27,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=180, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-10-24 19:28:27,386 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-10-24 19:28:27,386 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 180 flow [2024-10-24 19:28:27,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-10-24 19:28:27,386 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:27,387 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-10-24 19:28:27,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 19:28:27,587 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-10-24 19:28:27,587 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:27,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1899929211, now seen corresponding path program 1 times [2024-10-24 19:28:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:27,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188077420] [2024-10-24 19:28:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:27,590 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-10-24 19:28:27,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:27,592 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-10-24 19:28:27,593 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-10-24 19:28:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:27,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:28:27,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:27,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:27,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:27,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188077420] [2024-10-24 19:28:27,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188077420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:27,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:27,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:27,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516094333] [2024-10-24 19:28:27,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:27,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:28:27,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:27,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:28:27,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:28:27,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:27,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 180 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-10-24 19:28:27,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:27,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:27,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:28,075 INFO L124 PetriNetUnfolderBase]: 1500/3331 cut-off events. [2024-10-24 19:28:28,075 INFO L125 PetriNetUnfolderBase]: For 1126/1132 co-relation queries the response was YES. [2024-10-24 19:28:28,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7301 conditions, 3331 events. 1500/3331 cut-off events. For 1126/1132 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 19732 event pairs, 913 based on Foata normal form. 23/3274 useless extension candidates. Maximal degree in co-relation 7283. Up to 2099 conditions per place. [2024-10-24 19:28:28,089 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 57 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-10-24 19:28:28,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 385 flow [2024-10-24 19:28:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:28:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:28:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-10-24 19:28:28,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-24 19:28:28,091 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 180 flow. Second operand 3 states and 116 transitions. [2024-10-24 19:28:28,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 385 flow [2024-10-24 19:28:28,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 385 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 19:28:28,095 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 192 flow [2024-10-24 19:28:28,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-10-24 19:28:28,097 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2024-10-24 19:28:28,097 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 192 flow [2024-10-24 19:28:28,097 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-10-24 19:28:28,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:28,097 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:28,103 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 (11)] Forceful destruction successful, exit code 0 [2024-10-24 19:28:28,298 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-10-24 19:28:28,299 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:28,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2029881254, now seen corresponding path program 1 times [2024-10-24 19:28:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:28,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299614549] [2024-10-24 19:28:28,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:28,304 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-10-24 19:28:28,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:28,307 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-10-24 19:28:28,308 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-10-24 19:28:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:28,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:28:28,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:28,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:28,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:28,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299614549] [2024-10-24 19:28:28,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299614549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:28,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:28,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:28:28,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679594687] [2024-10-24 19:28:28,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:28,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:28:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:28,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:28:28,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:28:28,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:28,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:28,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:28,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:28,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:28,851 INFO L124 PetriNetUnfolderBase]: 1060/2349 cut-off events. [2024-10-24 19:28:28,851 INFO L125 PetriNetUnfolderBase]: For 1046/1050 co-relation queries the response was YES. [2024-10-24 19:28:28,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5552 conditions, 2349 events. 1060/2349 cut-off events. For 1046/1050 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12002 event pairs, 367 based on Foata normal form. 18/2322 useless extension candidates. Maximal degree in co-relation 5532. Up to 1219 conditions per place. [2024-10-24 19:28:28,861 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 59 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2024-10-24 19:28:28,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 409 flow [2024-10-24 19:28:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:28:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:28:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-10-24 19:28:28,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2024-10-24 19:28:28,862 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 192 flow. Second operand 4 states and 140 transitions. [2024-10-24 19:28:28,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 409 flow [2024-10-24 19:28:28,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:28:28,865 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 200 flow [2024-10-24 19:28:28,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-10-24 19:28:28,865 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2024-10-24 19:28:28,865 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 200 flow [2024-10-24 19:28:28,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:28:28,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:28,866 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:28,872 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 (12)] Forceful destruction successful, exit code 0 [2024-10-24 19:28:29,066 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-10-24 19:28:29,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:29,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:29,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1991454133, now seen corresponding path program 1 times [2024-10-24 19:28:29,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:29,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540126081] [2024-10-24 19:28:29,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:29,067 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-10-24 19:28:29,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:29,070 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-10-24 19:28:29,071 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-10-24 19:28:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:29,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 19:28:29,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:29,328 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-10-24 19:28:29,456 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-10-24 19:28:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:29,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:29,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:29,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540126081] [2024-10-24 19:28:29,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540126081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:29,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:29,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 19:28:29,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919902380] [2024-10-24 19:28:29,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:29,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:28:29,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:29,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:28:29,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:28:29,667 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:29,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 200 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-10-24 19:28:29,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:29,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:29,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:30,460 INFO L124 PetriNetUnfolderBase]: 1223/2688 cut-off events. [2024-10-24 19:28:30,460 INFO L125 PetriNetUnfolderBase]: For 1357/1363 co-relation queries the response was YES. [2024-10-24 19:28:30,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6409 conditions, 2688 events. 1223/2688 cut-off events. For 1357/1363 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 14417 event pairs, 423 based on Foata normal form. 0/2638 useless extension candidates. Maximal degree in co-relation 6387. Up to 1724 conditions per place. [2024-10-24 19:28:30,472 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 97 selfloop transitions, 14 changer transitions 0/129 dead transitions. [2024-10-24 19:28:30,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 689 flow [2024-10-24 19:28:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:28:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:28:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 331 transitions. [2024-10-24 19:28:30,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5188087774294671 [2024-10-24 19:28:30,474 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 200 flow. Second operand 11 states and 331 transitions. [2024-10-24 19:28:30,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 689 flow [2024-10-24 19:28:30,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 129 transitions, 680 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:28:30,478 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 310 flow [2024-10-24 19:28:30,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=310, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2024-10-24 19:28:30,480 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2024-10-24 19:28:30,480 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 310 flow [2024-10-24 19:28:30,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-10-24 19:28:30,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:30,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:30,486 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 (13)] Forceful destruction successful, exit code 0 [2024-10-24 19:28:30,681 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-10-24 19:28:30,681 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:30,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1026449227, now seen corresponding path program 2 times [2024-10-24 19:28:30,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:30,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29455634] [2024-10-24 19:28:30,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:28:30,682 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-10-24 19:28:30,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:30,683 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-10-24 19:28:30,685 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-10-24 19:28:30,793 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 19:28:30,793 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:28:30,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 19:28:30,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:30,987 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-10-24 19:28:31,110 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-10-24 19:28:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:31,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:31,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:31,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29455634] [2024-10-24 19:28:31,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29455634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:31,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:31,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 19:28:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998504607] [2024-10-24 19:28:31,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:31,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:28:31,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:31,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:28:31,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:28:31,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:31,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 310 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-10-24 19:28:31,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:31,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:31,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:32,112 INFO L124 PetriNetUnfolderBase]: 1419/3089 cut-off events. [2024-10-24 19:28:32,113 INFO L125 PetriNetUnfolderBase]: For 2960/2966 co-relation queries the response was YES. [2024-10-24 19:28:32,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8239 conditions, 3089 events. 1419/3089 cut-off events. For 2960/2966 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17155 event pairs, 494 based on Foata normal form. 0/3033 useless extension candidates. Maximal degree in co-relation 8211. Up to 2015 conditions per place. [2024-10-24 19:28:32,126 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 99 selfloop transitions, 20 changer transitions 0/137 dead transitions. [2024-10-24 19:28:32,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 137 transitions, 874 flow [2024-10-24 19:28:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:28:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:28:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 332 transitions. [2024-10-24 19:28:32,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5203761755485894 [2024-10-24 19:28:32,128 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 310 flow. Second operand 11 states and 332 transitions. [2024-10-24 19:28:32,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 137 transitions, 874 flow [2024-10-24 19:28:32,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 137 transitions, 853 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-24 19:28:32,138 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 512 flow [2024-10-24 19:28:32,138 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=512, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2024-10-24 19:28:32,139 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2024-10-24 19:28:32,139 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 512 flow [2024-10-24 19:28:32,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-10-24 19:28:32,139 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:32,140 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:32,144 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-10-24 19:28:32,340 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-10-24 19:28:32,340 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:32,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:32,341 INFO L85 PathProgramCache]: Analyzing trace with hash -614323253, now seen corresponding path program 3 times [2024-10-24 19:28:32,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:32,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664409836] [2024-10-24 19:28:32,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 19:28:32,342 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-10-24 19:28:32,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:32,343 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-10-24 19:28:32,347 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-10-24 19:28:32,458 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-24 19:28:32,458 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:28:32,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 19:28:32,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:32,614 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-10-24 19:28:32,717 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-10-24 19:28:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:32,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:32,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:32,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664409836] [2024-10-24 19:28:32,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664409836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:32,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:32,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 19:28:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868687377] [2024-10-24 19:28:32,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:32,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:28:32,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:32,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:28:32,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:28:32,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 58 [2024-10-24 19:28:32,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 512 flow. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-10-24 19:28:32,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:32,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 58 [2024-10-24 19:28:32,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:33,628 INFO L124 PetriNetUnfolderBase]: 1566/3406 cut-off events. [2024-10-24 19:28:33,628 INFO L125 PetriNetUnfolderBase]: For 4668/4676 co-relation queries the response was YES. [2024-10-24 19:28:33,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9693 conditions, 3406 events. 1566/3406 cut-off events. For 4668/4676 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19484 event pairs, 491 based on Foata normal form. 0/3351 useless extension candidates. Maximal degree in co-relation 9659. Up to 2284 conditions per place. [2024-10-24 19:28:33,645 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 113 selfloop transitions, 20 changer transitions 0/151 dead transitions. [2024-10-24 19:28:33,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 151 transitions, 1093 flow [2024-10-24 19:28:33,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:28:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:28:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 333 transitions. [2024-10-24 19:28:33,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5219435736677116 [2024-10-24 19:28:33,649 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 512 flow. Second operand 11 states and 333 transitions. [2024-10-24 19:28:33,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 151 transitions, 1093 flow [2024-10-24 19:28:33,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 151 transitions, 1035 flow, removed 29 selfloop flow, removed 0 redundant places. [2024-10-24 19:28:33,665 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 659 flow [2024-10-24 19:28:33,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=659, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2024-10-24 19:28:33,666 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 59 predicate places. [2024-10-24 19:28:33,666 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 659 flow [2024-10-24 19:28:33,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-10-24 19:28:33,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:33,667 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:33,675 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 (15)] Forceful destruction successful, exit code 0 [2024-10-24 19:28:33,868 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-10-24 19:28:33,868 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:33,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1412077873, now seen corresponding path program 4 times [2024-10-24 19:28:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:33,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261553247] [2024-10-24 19:28:33,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 19:28:33,869 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-10-24 19:28:33,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:33,871 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-10-24 19:28:33,871 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-10-24 19:28:33,977 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 19:28:33,977 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:28:33,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 19:28:33,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:34,109 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-10-24 19:28:34,261 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-10-24 19:28:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:28:34,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:28:34,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261553247] [2024-10-24 19:28:34,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261553247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:28:34,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:28:34,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 19:28:34,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88622793] [2024-10-24 19:28:34,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:28:34,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 19:28:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:34,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 19:28:34,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-24 19:28:34,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-24 19:28:34,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 93 transitions, 659 flow. Second operand has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 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-10-24 19:28:34,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:34,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-24 19:28:34,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:35,284 INFO L124 PetriNetUnfolderBase]: 1607/3447 cut-off events. [2024-10-24 19:28:35,284 INFO L125 PetriNetUnfolderBase]: For 5239/5259 co-relation queries the response was YES. [2024-10-24 19:28:35,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10045 conditions, 3447 events. 1607/3447 cut-off events. For 5239/5259 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 19624 event pairs, 322 based on Foata normal form. 4/3413 useless extension candidates. Maximal degree in co-relation 10003. Up to 1179 conditions per place. [2024-10-24 19:28:35,301 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 114 selfloop transitions, 52 changer transitions 0/183 dead transitions. [2024-10-24 19:28:35,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 183 transitions, 1341 flow [2024-10-24 19:28:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 19:28:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-24 19:28:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 410 transitions. [2024-10-24 19:28:35,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5049261083743842 [2024-10-24 19:28:35,303 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 659 flow. Second operand 14 states and 410 transitions. [2024-10-24 19:28:35,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 183 transitions, 1341 flow [2024-10-24 19:28:35,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 183 transitions, 1295 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-10-24 19:28:35,320 INFO L231 Difference]: Finished difference. Result has 127 places, 100 transitions, 839 flow [2024-10-24 19:28:35,320 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=839, PETRI_PLACES=127, PETRI_TRANSITIONS=100} [2024-10-24 19:28:35,321 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 75 predicate places. [2024-10-24 19:28:35,321 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 100 transitions, 839 flow [2024-10-24 19:28:35,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 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-10-24 19:28:35,321 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:35,321 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:35,326 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-10-24 19:28:35,521 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-10-24 19:28:35,522 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-10-24 19:28:35,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:35,522 INFO L85 PathProgramCache]: Analyzing trace with hash 354936341, now seen corresponding path program 1 times [2024-10-24 19:28:35,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:35,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745791751] [2024-10-24 19:28:35,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:35,523 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-10-24 19:28:35,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:35,524 INFO L229 MonitoredProcess]: Starting monitored process 17 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-10-24 19:28:35,525 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 (17)] Waiting until timeout for monitored process [2024-10-24 19:28:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:28:35,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:28:35,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:28:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:28:35,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:28:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:28:35,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:28:35,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745791751] [2024-10-24 19:28:35,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745791751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:28:35,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:28:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-24 19:28:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981907305] [2024-10-24 19:28:35,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:28:35,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:28:35,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:28:35,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:28:35,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:28:35,669 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 58 [2024-10-24 19:28:35,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 100 transitions, 839 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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-10-24 19:28:35,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:28:35,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 58 [2024-10-24 19:28:35,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:28:36,603 INFO L124 PetriNetUnfolderBase]: 3271/6747 cut-off events. [2024-10-24 19:28:36,604 INFO L125 PetriNetUnfolderBase]: For 9806/9820 co-relation queries the response was YES. [2024-10-24 19:28:36,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19477 conditions, 6747 events. 3271/6747 cut-off events. For 9806/9820 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42834 event pairs, 450 based on Foata normal form. 295/6939 useless extension candidates. Maximal degree in co-relation 19430. Up to 1411 conditions per place. [2024-10-24 19:28:36,646 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 149 selfloop transitions, 25 changer transitions 0/191 dead transitions. [2024-10-24 19:28:36,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 191 transitions, 1744 flow [2024-10-24 19:28:36,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:28:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:28:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2024-10-24 19:28:36,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2024-10-24 19:28:36,651 INFO L175 Difference]: Start difference. First operand has 127 places, 100 transitions, 839 flow. Second operand 6 states and 236 transitions. [2024-10-24 19:28:36,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 191 transitions, 1744 flow [2024-10-24 19:28:36,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 191 transitions, 1418 flow, removed 74 selfloop flow, removed 16 redundant places. [2024-10-24 19:28:36,689 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 742 flow [2024-10-24 19:28:36,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=120, PETRI_TRANSITIONS=103} [2024-10-24 19:28:36,691 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 68 predicate places. [2024-10-24 19:28:36,691 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 742 flow [2024-10-24 19:28:36,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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-10-24 19:28:36,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:28:36,691 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-24 19:28:36,697 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 (17)] Ended with exit code 0 [2024-10-24 19:28:36,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-10-24 19:28:36,892 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-10-24 19:28:36,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:28:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash -92586119, now seen corresponding path program 1 times [2024-10-24 19:28:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:28:36,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512293367] [2024-10-24 19:28:36,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:28:36,894 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-10-24 19:28:36,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:28:36,895 INFO L229 MonitoredProcess]: Starting monitored process 18 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-10-24 19:28:36,896 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 (18)] Waiting until timeout for monitored process [2024-10-24 19:28:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:28:37,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:28:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:28:37,133 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 19:28:37,133 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:28:37,134 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2024-10-24 19:28:37,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2024-10-24 19:28:37,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2024-10-24 19:28:37,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2024-10-24 19:28:37,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-10-24 19:28:37,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-10-24 19:28:37,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2024-10-24 19:28:37,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-10-24 19:28:37,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-10-24 19:28:37,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2024-10-24 19:28:37,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-10-24 19:28:37,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-10-24 19:28:37,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2024-10-24 19:28:37,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-10-24 19:28:37,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2024-10-24 19:28:37,144 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 (18)] Ended with exit code 0 [2024-10-24 19:28:37,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-10-24 19:28:37,337 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:28:37,382 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 19:28:37,382 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:28:37,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:28:37 BasicIcfg [2024-10-24 19:28:37,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:28:37,387 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:28:37,387 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:28:37,387 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:28:37,387 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:28:21" (3/4) ... [2024-10-24 19:28:37,389 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 19:28:37,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:28:37,390 INFO L158 Benchmark]: Toolchain (without parser) took 17425.86ms. Allocated memory was 79.7MB in the beginning and 383.8MB in the end (delta: 304.1MB). Free memory was 44.9MB in the beginning and 211.8MB in the end (delta: -166.9MB). Peak memory consumption was 135.6MB. Max. memory is 16.1GB. [2024-10-24 19:28:37,390 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 79.7MB. Free memory is still 56.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:28:37,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.47ms. Allocated memory is still 79.7MB. Free memory was 44.9MB in the beginning and 46.2MB in the end (delta: -1.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-10-24 19:28:37,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.94ms. Allocated memory is still 79.7MB. Free memory was 46.2MB in the beginning and 43.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:28:37,391 INFO L158 Benchmark]: Boogie Preprocessor took 43.60ms. Allocated memory is still 79.7MB. Free memory was 43.8MB in the beginning and 40.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:28:37,391 INFO L158 Benchmark]: RCFGBuilder took 752.93ms. Allocated memory was 79.7MB in the beginning and 113.2MB in the end (delta: 33.6MB). Free memory was 40.5MB in the beginning and 80.0MB in the end (delta: -39.5MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2024-10-24 19:28:37,391 INFO L158 Benchmark]: TraceAbstraction took 16077.38ms. Allocated memory was 113.2MB in the beginning and 383.8MB in the end (delta: 270.5MB). Free memory was 79.3MB in the beginning and 211.8MB in the end (delta: -132.5MB). Peak memory consumption was 137.3MB. Max. memory is 16.1GB. [2024-10-24 19:28:37,391 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 383.8MB. Free memory is still 211.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:28:37,392 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.24ms. Allocated memory is still 79.7MB. Free memory is still 56.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.47ms. Allocated memory is still 79.7MB. Free memory was 44.9MB in the beginning and 46.2MB in the end (delta: -1.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.94ms. Allocated memory is still 79.7MB. Free memory was 46.2MB in the beginning and 43.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.60ms. Allocated memory is still 79.7MB. Free memory was 43.8MB in the beginning and 40.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 752.93ms. Allocated memory was 79.7MB in the beginning and 113.2MB in the end (delta: 33.6MB). Free memory was 40.5MB in the beginning and 80.0MB in the end (delta: -39.5MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16077.38ms. Allocated memory was 113.2MB in the beginning and 383.8MB in the end (delta: 270.5MB). Free memory was 79.3MB in the beginning and 211.8MB in the end (delta: -132.5MB). Peak memory consumption was 137.3MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 383.8MB. Free memory is still 211.8MB. 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]; [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=0, 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] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=0, id2=1, 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] [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, 89 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.9s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1065 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 946 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 492 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4182 IncrementalHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 19 mSDtfsCounter, 4182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=839occurred in iteration=15, InterpolantAutomatonStates: 89, 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.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 2507 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1550 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 10/12 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-10-24 19:28:37,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample