./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c -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 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:50:38,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:50:38,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:50:38,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:50:38,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:50:38,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:50:38,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:50:38,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:50:38,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:50:38,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:50:38,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:50:38,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:50:38,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:50:38,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:50:38,240 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:50:38,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:50:38,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:50:38,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:50:38,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:50:38,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:50:38,242 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:50:38,243 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:50:38,243 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:50:38,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:50:38,247 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:50:38,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:50:38,248 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:50:38,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:50:38,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:50:38,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:50:38,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:50:38,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:50:38,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:50:38,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:50:38,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:50:38,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:50:38,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:50:38,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:50:38,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:50:38,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:50:38,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:50:38,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:50:38,253 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2024-11-09 10:50:38,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:50:38,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:50:38,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:50:38,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:50:38,570 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:50:38,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-09 10:50:39,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:50:40,169 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:50:40,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-09 10:50:40,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d690eb416/ae57e87448624f97827ec944da77a355/FLAG3fce92255 [2024-11-09 10:50:40,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d690eb416/ae57e87448624f97827ec944da77a355 [2024-11-09 10:50:40,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:50:40,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:50:40,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:50:40,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:50:40,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:50:40,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257c79e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40, skipping insertion in model container [2024-11-09 10:50:40,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:50:40,831 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:50:40,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:50:40,850 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:50:40,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:50:40,897 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:50:40,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40 WrapperNode [2024-11-09 10:50:40,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:50:40,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:50:40,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:50:40,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:50:40,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,945 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 136 [2024-11-09 10:50:40,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:50:40,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:50:40,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:50:40,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:50:40,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,974 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-09 10:50:40,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:40,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:50:40,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:50:40,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:50:40,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:50:40,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (1/1) ... [2024-11-09 10:50:41,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:50:41,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:41,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:50:41,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:50:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:50:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:50:41,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:50:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:50:41,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:50:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:50:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:50:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:50:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:50:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:50:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:50:41,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:50:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:50:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:50:41,079 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:50:41,189 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:50:41,191 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:50:41,485 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:50:41,486 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:50:41,702 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:50:41,702 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 10:50:41,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:50:41 BoogieIcfgContainer [2024-11-09 10:50:41,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:50:41,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:50:41,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:50:41,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:50:41,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:50:40" (1/3) ... [2024-11-09 10:50:41,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d0a63b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:50:41, skipping insertion in model container [2024-11-09 10:50:41,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:40" (2/3) ... [2024-11-09 10:50:41,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d0a63b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:50:41, skipping insertion in model container [2024-11-09 10:50:41,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:50:41" (3/3) ... [2024-11-09 10:50:41,713 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-11-09 10:50:41,731 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:50:41,732 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 10:50:41,732 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:50:41,794 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:50:41,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 84 flow [2024-11-09 10:50:41,871 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2024-11-09 10:50:41,872 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:50:41,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-11-09 10:50:41,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 84 flow [2024-11-09 10:50:41,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 76 flow [2024-11-09 10:50:41,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:50:41,899 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;@249eb595, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:50:41,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-09 10:50:41,903 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:50:41,903 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-09 10:50:41,905 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:50:41,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:41,906 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:50:41,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:41,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash 454067, now seen corresponding path program 1 times [2024-11-09 10:50:41,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:41,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607902203] [2024-11-09 10:50:41,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:41,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:42,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-11-09 10:50:42,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:42,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607902203] [2024-11-09 10:50:42,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607902203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:42,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:42,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:50:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596640157] [2024-11-09 10:50:42,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:42,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:50:42,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:42,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:50:42,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:50:42,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:42,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:42,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:42,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:42,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:42,406 INFO L124 PetriNetUnfolderBase]: 62/133 cut-off events. [2024-11-09 10:50:42,406 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 10:50:42,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 133 events. 62/133 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 454 event pairs, 42 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 220. Up to 109 conditions per place. [2024-11-09 10:50:42,411 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 17 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-11-09 10:50:42,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 108 flow [2024-11-09 10:50:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:50:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:50:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-09 10:50:42,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-09 10:50:42,426 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 60 transitions. [2024-11-09 10:50:42,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 108 flow [2024-11-09 10:50:42,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:50:42,431 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2024-11-09 10:50:42,434 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-11-09 10:50:42,439 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-09 10:50:42,440 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2024-11-09 10:50:42,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:42,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:42,440 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:50:42,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:50:42,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:42,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:42,442 INFO L85 PathProgramCache]: Analyzing trace with hash 454068, now seen corresponding path program 1 times [2024-11-09 10:50:42,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:42,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562686914] [2024-11-09 10:50:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:42,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:42,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:42,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562686914] [2024-11-09 10:50:42,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562686914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:42,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:42,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:50:42,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730103105] [2024-11-09 10:50:42,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:42,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:50:42,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:42,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:50:42,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:50:42,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:42,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:42,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:42,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:42,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:42,891 INFO L124 PetriNetUnfolderBase]: 63/136 cut-off events. [2024-11-09 10:50:42,891 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:50:42,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 136 events. 63/136 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 463 event pairs, 42 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 240. Up to 114 conditions per place. [2024-11-09 10:50:42,893 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-11-09 10:50:42,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 120 flow [2024-11-09 10:50:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:50:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:50:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2024-11-09 10:50:42,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-09 10:50:42,895 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 76 transitions. [2024-11-09 10:50:42,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 120 flow [2024-11-09 10:50:42,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:50:42,898 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2024-11-09 10:50:42,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2024-11-09 10:50:42,898 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2024-11-09 10:50:42,899 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2024-11-09 10:50:42,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:42,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:42,899 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-09 10:50:42,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:50:42,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:42,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:42,900 INFO L85 PathProgramCache]: Analyzing trace with hash 436373278, now seen corresponding path program 1 times [2024-11-09 10:50:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:42,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916606614] [2024-11-09 10:50:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916606614] [2024-11-09 10:50:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916606614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:43,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278471643] [2024-11-09 10:50:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:43,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:43,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 10:50:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:43,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:50:43,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:43,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-09 10:50:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:43,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:43,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278471643] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:43,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:43,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-09 10:50:43,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475712499] [2024-11-09 10:50:43,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:43,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:50:43,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:50:43,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:50:43,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:43,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:43,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:43,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:43,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:43,992 INFO L124 PetriNetUnfolderBase]: 63/135 cut-off events. [2024-11-09 10:50:43,993 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:50:43,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 135 events. 63/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 452 event pairs, 42 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 247. Up to 110 conditions per place. [2024-11-09 10:50:43,994 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 15 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2024-11-09 10:50:43,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 129 flow [2024-11-09 10:50:43,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:50:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:50:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-11-09 10:50:43,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-11-09 10:50:43,997 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 6 states and 101 transitions. [2024-11-09 10:50:43,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 129 flow [2024-11-09 10:50:43,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:50:43,999 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 96 flow [2024-11-09 10:50:43,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2024-11-09 10:50:44,000 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2024-11-09 10:50:44,000 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 96 flow [2024-11-09 10:50:44,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:44,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:44,001 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:50:44,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:50:44,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:44,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:44,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash 644602332, now seen corresponding path program 1 times [2024-11-09 10:50:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:44,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051975710] [2024-11-09 10:50:44,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:44,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:44,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051975710] [2024-11-09 10:50:44,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051975710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:44,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:44,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:50:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213723883] [2024-11-09 10:50:44,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:44,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:50:44,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:44,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:50:44,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:50:44,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-09 10:50:44,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:44,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:44,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-09 10:50:44,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:44,362 INFO L124 PetriNetUnfolderBase]: 63/130 cut-off events. [2024-11-09 10:50:44,362 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:50:44,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 130 events. 63/130 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 416 event pairs, 42 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 243. Up to 109 conditions per place. [2024-11-09 10:50:44,365 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 19 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-11-09 10:50:44,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 136 flow [2024-11-09 10:50:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:50:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:50:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-11-09 10:50:44,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-11-09 10:50:44,369 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 96 flow. Second operand 4 states and 65 transitions. [2024-11-09 10:50:44,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 136 flow [2024-11-09 10:50:44,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 106 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-11-09 10:50:44,371 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 68 flow [2024-11-09 10:50:44,372 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-11-09 10:50:44,373 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-09 10:50:44,373 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 68 flow [2024-11-09 10:50:44,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:44,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:44,374 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:50:44,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:50:44,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:44,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:44,376 INFO L85 PathProgramCache]: Analyzing trace with hash 644602333, now seen corresponding path program 1 times [2024-11-09 10:50:44,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:44,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017611173] [2024-11-09 10:50:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:44,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:44,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017611173] [2024-11-09 10:50:44,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017611173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:44,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:44,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:50:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442750561] [2024-11-09 10:50:44,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:44,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:50:44,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:44,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:50:44,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:50:44,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:44,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-11-09 10:50:44,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:44,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:44,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:44,557 INFO L124 PetriNetUnfolderBase]: 113/239 cut-off events. [2024-11-09 10:50:44,557 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:50:44,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 239 events. 113/239 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 931 event pairs, 72 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 289. Up to 136 conditions per place. [2024-11-09 10:50:44,559 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 38 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-11-09 10:50:44,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 49 transitions, 199 flow [2024-11-09 10:50:44,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:50:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:50:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-11-09 10:50:44,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6228571428571429 [2024-11-09 10:50:44,565 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 68 flow. Second operand 5 states and 109 transitions. [2024-11-09 10:50:44,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 49 transitions, 199 flow [2024-11-09 10:50:44,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 49 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:50:44,566 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 89 flow [2024-11-09 10:50:44,566 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2024-11-09 10:50:44,567 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2024-11-09 10:50:44,569 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 89 flow [2024-11-09 10:50:44,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-11-09 10:50:44,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:44,569 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:44,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:50:44,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:44,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:44,573 INFO L85 PathProgramCache]: Analyzing trace with hash 978870344, now seen corresponding path program 1 times [2024-11-09 10:50:44,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:44,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231406926] [2024-11-09 10:50:44,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:44,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:44,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:44,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231406926] [2024-11-09 10:50:44,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231406926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:44,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:44,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:50:44,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191929323] [2024-11-09 10:50:44,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:44,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:50:44,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:44,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:50:44,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:50:44,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:44,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:44,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:44,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:44,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:44,784 INFO L124 PetriNetUnfolderBase]: 97/211 cut-off events. [2024-11-09 10:50:44,784 INFO L125 PetriNetUnfolderBase]: For 65/74 co-relation queries the response was YES. [2024-11-09 10:50:44,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 211 events. 97/211 cut-off events. For 65/74 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 775 event pairs, 67 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 319. Up to 134 conditions per place. [2024-11-09 10:50:44,787 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 33 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2024-11-09 10:50:44,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 204 flow [2024-11-09 10:50:44,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:50:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:50:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-11-09 10:50:44,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5942857142857143 [2024-11-09 10:50:44,789 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 89 flow. Second operand 5 states and 104 transitions. [2024-11-09 10:50:44,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 204 flow [2024-11-09 10:50:44,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:50:44,791 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 109 flow [2024-11-09 10:50:44,791 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-11-09 10:50:44,792 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2024-11-09 10:50:44,792 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 109 flow [2024-11-09 10:50:44,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:44,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:44,794 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:44,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:50:44,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:44,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash -867315661, now seen corresponding path program 1 times [2024-11-09 10:50:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:44,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183935117] [2024-11-09 10:50:44,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:44,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:44,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:44,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183935117] [2024-11-09 10:50:44,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183935117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:44,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23458201] [2024-11-09 10:50:44,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:44,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:44,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:44,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:44,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 10:50:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:44,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:50:44,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:45,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:45,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2024-11-09 10:50:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:45,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23458201] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:45,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:45,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 10:50:45,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683534299] [2024-11-09 10:50:45,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:45,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:50:45,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:45,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:50:45,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:50:45,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:45,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 109 flow. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:45,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:45,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:45,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:45,454 INFO L124 PetriNetUnfolderBase]: 136/293 cut-off events. [2024-11-09 10:50:45,454 INFO L125 PetriNetUnfolderBase]: For 111/124 co-relation queries the response was YES. [2024-11-09 10:50:45,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 293 events. 136/293 cut-off events. For 111/124 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1187 event pairs, 64 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 514. Up to 118 conditions per place. [2024-11-09 10:50:45,458 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 42 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2024-11-09 10:50:45,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 275 flow [2024-11-09 10:50:45,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:50:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:50:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-11-09 10:50:45,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5836734693877551 [2024-11-09 10:50:45,461 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 109 flow. Second operand 7 states and 143 transitions. [2024-11-09 10:50:45,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 275 flow [2024-11-09 10:50:45,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:50:45,465 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 145 flow [2024-11-09 10:50:45,466 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-11-09 10:50:45,466 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2024-11-09 10:50:45,467 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 145 flow [2024-11-09 10:50:45,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:45,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:45,469 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:45,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:50:45,672 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,SelfDestructingSolverStorable6 [2024-11-09 10:50:45,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:45,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash -275375842, now seen corresponding path program 1 times [2024-11-09 10:50:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:45,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766659549] [2024-11-09 10:50:45,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:45,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:45,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:45,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766659549] [2024-11-09 10:50:45,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766659549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:45,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072903431] [2024-11-09 10:50:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:45,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:45,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:45,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:45,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 10:50:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:45,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:50:45,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:46,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:46,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2024-11-09 10:50:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072903431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:46,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:46,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 10:50:46,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279152357] [2024-11-09 10:50:46,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:46,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:50:46,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:46,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:50:46,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:50:46,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:46,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 145 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:46,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:46,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:46,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:46,387 INFO L124 PetriNetUnfolderBase]: 198/395 cut-off events. [2024-11-09 10:50:46,388 INFO L125 PetriNetUnfolderBase]: For 525/574 co-relation queries the response was YES. [2024-11-09 10:50:46,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 395 events. 198/395 cut-off events. For 525/574 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1637 event pairs, 88 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 911. Up to 179 conditions per place. [2024-11-09 10:50:46,391 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 49 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2024-11-09 10:50:46,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 381 flow [2024-11-09 10:50:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:50:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:50:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-11-09 10:50:46,393 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5755102040816327 [2024-11-09 10:50:46,393 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 145 flow. Second operand 7 states and 141 transitions. [2024-11-09 10:50:46,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 381 flow [2024-11-09 10:50:46,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 365 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-09 10:50:46,396 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 174 flow [2024-11-09 10:50:46,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-09 10:50:46,397 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2024-11-09 10:50:46,397 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 174 flow [2024-11-09 10:50:46,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:46,398 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:46,398 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:46,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:50:46,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:46,603 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:46,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1418714776, now seen corresponding path program 1 times [2024-11-09 10:50:46,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:46,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375986120] [2024-11-09 10:50:46,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:46,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:46,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375986120] [2024-11-09 10:50:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375986120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212568499] [2024-11-09 10:50:46,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:46,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:46,688 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:46,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 10:50:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:46,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:50:46,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:46,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:46,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212568499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:46,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:46,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-09 10:50:46,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887135157] [2024-11-09 10:50:46,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:46,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:50:46,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:46,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:50:46,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:50:46,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:46,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 174 flow. Second operand has 14 states, 14 states have (on average 14.928571428571429) internal successors, (209), 14 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:46,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:46,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:46,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:47,177 INFO L124 PetriNetUnfolderBase]: 361/745 cut-off events. [2024-11-09 10:50:47,177 INFO L125 PetriNetUnfolderBase]: For 994/1028 co-relation queries the response was YES. [2024-11-09 10:50:47,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 745 events. 361/745 cut-off events. For 994/1028 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3643 event pairs, 182 based on Foata normal form. 14/754 useless extension candidates. Maximal degree in co-relation 1208. Up to 322 conditions per place. [2024-11-09 10:50:47,183 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 65 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2024-11-09 10:50:47,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 546 flow [2024-11-09 10:50:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:50:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:50:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-11-09 10:50:47,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2024-11-09 10:50:47,185 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 174 flow. Second operand 8 states and 162 transitions. [2024-11-09 10:50:47,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 546 flow [2024-11-09 10:50:47,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 525 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-09 10:50:47,189 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 260 flow [2024-11-09 10:50:47,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-11-09 10:50:47,190 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2024-11-09 10:50:47,190 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 260 flow [2024-11-09 10:50:47,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.928571428571429) internal successors, (209), 14 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:47,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:47,190 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:47,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 10:50:47,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:47,392 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:47,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash -430698513, now seen corresponding path program 1 times [2024-11-09 10:50:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:47,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196961535] [2024-11-09 10:50:47,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:47,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:47,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196961535] [2024-11-09 10:50:47,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196961535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:50:47,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:50:47,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:50:47,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638449923] [2024-11-09 10:50:47,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:47,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:50:47,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:47,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:50:47,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:50:47,419 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-09 10:50:47,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:47,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:47,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-09 10:50:47,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:47,558 INFO L124 PetriNetUnfolderBase]: 479/930 cut-off events. [2024-11-09 10:50:47,559 INFO L125 PetriNetUnfolderBase]: For 1860/1941 co-relation queries the response was YES. [2024-11-09 10:50:47,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3106 conditions, 930 events. 479/930 cut-off events. For 1860/1941 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4602 event pairs, 138 based on Foata normal form. 3/930 useless extension candidates. Maximal degree in co-relation 1596. Up to 597 conditions per place. [2024-11-09 10:50:47,566 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 47 selfloop transitions, 3 changer transitions 6/61 dead transitions. [2024-11-09 10:50:47,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 451 flow [2024-11-09 10:50:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:50:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:50:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-09 10:50:47,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2024-11-09 10:50:47,569 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 260 flow. Second operand 3 states and 71 transitions. [2024-11-09 10:50:47,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 451 flow [2024-11-09 10:50:47,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 444 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-09 10:50:47,577 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 237 flow [2024-11-09 10:50:47,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-11-09 10:50:47,578 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2024-11-09 10:50:47,579 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 237 flow [2024-11-09 10:50:47,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:47,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:47,579 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:47,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:50:47,580 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:47,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:47,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1754825725, now seen corresponding path program 1 times [2024-11-09 10:50:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:47,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797320857] [2024-11-09 10:50:47,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:47,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:47,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797320857] [2024-11-09 10:50:47,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797320857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215445451] [2024-11-09 10:50:47,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:47,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:47,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:47,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:47,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 10:50:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:47,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:50:47,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:47,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215445451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:47,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:47,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-09 10:50:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781566816] [2024-11-09 10:50:47,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:47,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:50:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:50:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:50:47,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:47,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 237 flow. Second operand has 14 states, 14 states have (on average 15.071428571428571) internal successors, (211), 14 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:47,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:47,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:47,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:48,178 INFO L124 PetriNetUnfolderBase]: 356/689 cut-off events. [2024-11-09 10:50:48,179 INFO L125 PetriNetUnfolderBase]: For 1735/1834 co-relation queries the response was YES. [2024-11-09 10:50:48,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2420 conditions, 689 events. 356/689 cut-off events. For 1735/1834 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3350 event pairs, 209 based on Foata normal form. 13/690 useless extension candidates. Maximal degree in co-relation 1459. Up to 375 conditions per place. [2024-11-09 10:50:48,186 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 53 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-11-09 10:50:48,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 515 flow [2024-11-09 10:50:48,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:50:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:50:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-11-09 10:50:48,188 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5678571428571428 [2024-11-09 10:50:48,188 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 237 flow. Second operand 8 states and 159 transitions. [2024-11-09 10:50:48,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 515 flow [2024-11-09 10:50:48,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 488 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-11-09 10:50:48,193 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 281 flow [2024-11-09 10:50:48,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=281, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2024-11-09 10:50:48,195 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2024-11-09 10:50:48,195 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 281 flow [2024-11-09 10:50:48,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.071428571428571) internal successors, (211), 14 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:48,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:48,195 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:48,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:50:48,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 10:50:48,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:48,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:48,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1341733998, now seen corresponding path program 2 times [2024-11-09 10:50:48,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:48,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977917390] [2024-11-09 10:50:48,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:48,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:48,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977917390] [2024-11-09 10:50:48,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977917390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:48,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201343315] [2024-11-09 10:50:48,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:50:48,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:48,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:48,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:48,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 10:50:48,655 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:50:48,655 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:50:48,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 10:50:48,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:48,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:48,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-11-09 10:50:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:48,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201343315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:48,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:48,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-09 10:50:48,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735503925] [2024-11-09 10:50:48,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:48,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 10:50:48,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:48,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 10:50:48,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:50:49,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:49,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 281 flow. Second operand has 20 states, 20 states have (on average 14.65) internal successors, (293), 20 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:49,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:49,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:49,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:49,695 INFO L124 PetriNetUnfolderBase]: 383/785 cut-off events. [2024-11-09 10:50:49,695 INFO L125 PetriNetUnfolderBase]: For 1845/1866 co-relation queries the response was YES. [2024-11-09 10:50:49,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 785 events. 383/785 cut-off events. For 1845/1866 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3960 event pairs, 148 based on Foata normal form. 14/779 useless extension candidates. Maximal degree in co-relation 1778. Up to 215 conditions per place. [2024-11-09 10:50:49,701 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 75 selfloop transitions, 14 changer transitions 0/97 dead transitions. [2024-11-09 10:50:49,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 97 transitions, 705 flow [2024-11-09 10:50:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:50:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:50:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-11-09 10:50:49,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2024-11-09 10:50:49,703 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 281 flow. Second operand 10 states and 205 transitions. [2024-11-09 10:50:49,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 97 transitions, 705 flow [2024-11-09 10:50:49,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 690 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-09 10:50:49,710 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 338 flow [2024-11-09 10:50:49,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=338, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2024-11-09 10:50:49,711 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-11-09 10:50:49,713 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 338 flow [2024-11-09 10:50:49,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.65) internal successors, (293), 20 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:49,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:49,713 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:49,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 10:50:49,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:49,914 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:49,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1576057945, now seen corresponding path program 2 times [2024-11-09 10:50:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:49,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88089273] [2024-11-09 10:50:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:50,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:50,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88089273] [2024-11-09 10:50:50,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88089273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:50,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470451436] [2024-11-09 10:50:50,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:50:50,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:50,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:50,173 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:50,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 10:50:50,243 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:50:50,243 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:50:50,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 10:50:50,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:50,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:50,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-11-09 10:50:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:50,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470451436] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:50,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:50,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-09 10:50:50,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756114231] [2024-11-09 10:50:50,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:50,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 10:50:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:50,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 10:50:50,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:50:50,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:50,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 338 flow. Second operand has 20 states, 20 states have (on average 14.95) internal successors, (299), 20 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:50,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:50,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:50,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:51,222 INFO L124 PetriNetUnfolderBase]: 478/945 cut-off events. [2024-11-09 10:50:51,223 INFO L125 PetriNetUnfolderBase]: For 3382/3452 co-relation queries the response was YES. [2024-11-09 10:50:51,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 945 events. 478/945 cut-off events. For 3382/3452 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4701 event pairs, 193 based on Foata normal form. 19/942 useless extension candidates. Maximal degree in co-relation 2599. Up to 292 conditions per place. [2024-11-09 10:50:51,232 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 83 selfloop transitions, 14 changer transitions 0/105 dead transitions. [2024-11-09 10:50:51,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 905 flow [2024-11-09 10:50:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:50:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:50:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-11-09 10:50:51,234 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5742857142857143 [2024-11-09 10:50:51,234 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 338 flow. Second operand 10 states and 201 transitions. [2024-11-09 10:50:51,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 905 flow [2024-11-09 10:50:51,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 105 transitions, 832 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-11-09 10:50:51,241 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 377 flow [2024-11-09 10:50:51,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=377, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2024-11-09 10:50:51,242 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 40 predicate places. [2024-11-09 10:50:51,242 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 377 flow [2024-11-09 10:50:51,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.95) internal successors, (299), 20 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:51,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:51,243 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 10:50:51,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 10:50:51,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:51,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:51,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1788589, now seen corresponding path program 3 times [2024-11-09 10:50:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627614589] [2024-11-09 10:50:51,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627614589] [2024-11-09 10:50:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627614589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062686940] [2024-11-09 10:50:51,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:50:51,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:51,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:51,576 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:51,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 10:50:51,638 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 10:50:51,638 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:50:51,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:50:51,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:51,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-09 10:50:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 10:50:51,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 10:50:51,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062686940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:51,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:51,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2024-11-09 10:50:51,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129635748] [2024-11-09 10:50:51,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:51,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 10:50:51,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:51,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 10:50:51,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-09 10:50:52,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-09 10:50:52,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 377 flow. Second operand has 21 states, 21 states have (on average 14.095238095238095) internal successors, (296), 21 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:52,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:52,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-09 10:50:52,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:53,039 INFO L124 PetriNetUnfolderBase]: 917/1728 cut-off events. [2024-11-09 10:50:53,039 INFO L125 PetriNetUnfolderBase]: For 6272/6354 co-relation queries the response was YES. [2024-11-09 10:50:53,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 1728 events. 917/1728 cut-off events. For 6272/6354 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9487 event pairs, 213 based on Foata normal form. 36/1740 useless extension candidates. Maximal degree in co-relation 3763. Up to 261 conditions per place. [2024-11-09 10:50:53,058 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 170 selfloop transitions, 27 changer transitions 0/204 dead transitions. [2024-11-09 10:50:53,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 204 transitions, 1877 flow [2024-11-09 10:50:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:50:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 10:50:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 303 transitions. [2024-11-09 10:50:53,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5410714285714285 [2024-11-09 10:50:53,062 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 377 flow. Second operand 16 states and 303 transitions. [2024-11-09 10:50:53,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 204 transitions, 1877 flow [2024-11-09 10:50:53,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 204 transitions, 1722 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-11-09 10:50:53,081 INFO L231 Difference]: Finished difference. Result has 90 places, 65 transitions, 520 flow [2024-11-09 10:50:53,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=520, PETRI_PLACES=90, PETRI_TRANSITIONS=65} [2024-11-09 10:50:53,081 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 54 predicate places. [2024-11-09 10:50:53,082 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 65 transitions, 520 flow [2024-11-09 10:50:53,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 14.095238095238095) internal successors, (296), 21 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:53,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:53,082 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:53,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:50:53,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 10:50:53,283 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:53,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1157106110, now seen corresponding path program 3 times [2024-11-09 10:50:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026347293] [2024-11-09 10:50:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:53,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026347293] [2024-11-09 10:50:53,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026347293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:53,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589737490] [2024-11-09 10:50:53,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:50:53,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:53,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:53,419 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:53,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 10:50:53,488 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 10:50:53,489 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:50:53,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 10:50:53,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 10:50:53,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:53,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 11 [2024-11-09 10:50:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 10:50:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589737490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:53,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:53,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2024-11-09 10:50:53,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681796548] [2024-11-09 10:50:53,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 10:50:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:53,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 10:50:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:50:54,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-09 10:50:54,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 65 transitions, 520 flow. Second operand has 20 states, 20 states have (on average 14.35) internal successors, (287), 20 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:54,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:54,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-09 10:50:54,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:54,683 INFO L124 PetriNetUnfolderBase]: 839/1535 cut-off events. [2024-11-09 10:50:54,683 INFO L125 PetriNetUnfolderBase]: For 7705/7762 co-relation queries the response was YES. [2024-11-09 10:50:54,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6570 conditions, 1535 events. 839/1535 cut-off events. For 7705/7762 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8048 event pairs, 223 based on Foata normal form. 36/1546 useless extension candidates. Maximal degree in co-relation 3652. Up to 277 conditions per place. [2024-11-09 10:50:54,700 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 150 selfloop transitions, 27 changer transitions 0/185 dead transitions. [2024-11-09 10:50:54,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 185 transitions, 1911 flow [2024-11-09 10:50:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:50:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 10:50:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 295 transitions. [2024-11-09 10:50:54,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2024-11-09 10:50:54,705 INFO L175 Difference]: Start difference. First operand has 90 places, 65 transitions, 520 flow. Second operand 16 states and 295 transitions. [2024-11-09 10:50:54,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 185 transitions, 1911 flow [2024-11-09 10:50:54,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 185 transitions, 1770 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-11-09 10:50:54,722 INFO L231 Difference]: Finished difference. Result has 104 places, 73 transitions, 631 flow [2024-11-09 10:50:54,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=631, PETRI_PLACES=104, PETRI_TRANSITIONS=73} [2024-11-09 10:50:54,724 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 68 predicate places. [2024-11-09 10:50:54,724 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 73 transitions, 631 flow [2024-11-09 10:50:54,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.35) internal successors, (287), 20 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:54,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:54,725 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:54,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 10:50:54,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 10:50:54,925 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:54,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1622538570, now seen corresponding path program 1 times [2024-11-09 10:50:54,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:54,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440213749] [2024-11-09 10:50:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:54,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:55,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:55,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440213749] [2024-11-09 10:50:55,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440213749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:55,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346320489] [2024-11-09 10:50:55,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:55,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:55,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:55,012 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:55,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 10:50:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:55,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:50:55,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:55,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:50:55,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346320489] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:55,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:50:55,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2024-11-09 10:50:55,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638618188] [2024-11-09 10:50:55,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:55,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:50:55,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:55,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:50:55,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:50:55,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:55,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 73 transitions, 631 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:55,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:55,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:55,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:55,356 INFO L124 PetriNetUnfolderBase]: 775/1465 cut-off events. [2024-11-09 10:50:55,357 INFO L125 PetriNetUnfolderBase]: For 8508/8523 co-relation queries the response was YES. [2024-11-09 10:50:55,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6592 conditions, 1465 events. 775/1465 cut-off events. For 8508/8523 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7774 event pairs, 241 based on Foata normal form. 52/1496 useless extension candidates. Maximal degree in co-relation 4061. Up to 677 conditions per place. [2024-11-09 10:50:55,377 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 73 selfloop transitions, 13 changer transitions 0/94 dead transitions. [2024-11-09 10:50:55,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 94 transitions, 982 flow [2024-11-09 10:50:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:50:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:50:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-11-09 10:50:55,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-11-09 10:50:55,379 INFO L175 Difference]: Start difference. First operand has 104 places, 73 transitions, 631 flow. Second operand 5 states and 94 transitions. [2024-11-09 10:50:55,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 94 transitions, 982 flow [2024-11-09 10:50:55,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 94 transitions, 935 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-09 10:50:55,392 INFO L231 Difference]: Finished difference. Result has 100 places, 70 transitions, 577 flow [2024-11-09 10:50:55,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=100, PETRI_TRANSITIONS=70} [2024-11-09 10:50:55,393 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 64 predicate places. [2024-11-09 10:50:55,393 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 70 transitions, 577 flow [2024-11-09 10:50:55,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:55,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:55,394 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:55,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 10:50:55,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 10:50:55,595 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:55,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:55,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1592560192, now seen corresponding path program 1 times [2024-11-09 10:50:55,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:55,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751041549] [2024-11-09 10:50:55,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:55,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:50:55,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:55,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751041549] [2024-11-09 10:50:55,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751041549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:55,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892818302] [2024-11-09 10:50:55,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:55,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:55,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:55,666 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:55,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 10:50:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:55,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:50:55,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:50:55,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:50:55,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892818302] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:55,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:50:55,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-09 10:50:55,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645210745] [2024-11-09 10:50:55,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:50:55,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:50:55,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:55,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:50:55,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:50:55,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:50:55,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 70 transitions, 577 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:55,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:55,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:50:55,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:55,988 INFO L124 PetriNetUnfolderBase]: 718/1360 cut-off events. [2024-11-09 10:50:55,988 INFO L125 PetriNetUnfolderBase]: For 8292/8299 co-relation queries the response was YES. [2024-11-09 10:50:55,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5973 conditions, 1360 events. 718/1360 cut-off events. For 8292/8299 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7270 event pairs, 193 based on Foata normal form. 46/1363 useless extension candidates. Maximal degree in co-relation 4648. Up to 653 conditions per place. [2024-11-09 10:50:56,006 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 68 selfloop transitions, 13 changer transitions 0/89 dead transitions. [2024-11-09 10:50:56,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 905 flow [2024-11-09 10:50:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:50:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:50:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-11-09 10:50:56,008 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-09 10:50:56,008 INFO L175 Difference]: Start difference. First operand has 100 places, 70 transitions, 577 flow. Second operand 5 states and 95 transitions. [2024-11-09 10:50:56,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 905 flow [2024-11-09 10:50:56,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 853 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-11-09 10:50:56,019 INFO L231 Difference]: Finished difference. Result has 98 places, 67 transitions, 539 flow [2024-11-09 10:50:56,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=539, PETRI_PLACES=98, PETRI_TRANSITIONS=67} [2024-11-09 10:50:56,020 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 62 predicate places. [2024-11-09 10:50:56,020 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 67 transitions, 539 flow [2024-11-09 10:50:56,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:56,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:56,021 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:56,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 10:50:56,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 10:50:56,222 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:56,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2095331061, now seen corresponding path program 1 times [2024-11-09 10:50:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:56,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699337063] [2024-11-09 10:50:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:50:56,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:50:56,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699337063] [2024-11-09 10:50:56,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699337063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:50:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771625081] [2024-11-09 10:50:56,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:56,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:50:56,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:50:56,489 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:50:56,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 10:50:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:50:56,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 10:50:56,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:50:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:50:56,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:50:56,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:50:56,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2024-11-09 10:50:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:50:56,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771625081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:50:56,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:50:56,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2024-11-09 10:50:56,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796611825] [2024-11-09 10:50:56,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:50:56,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:50:56,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:50:56,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:50:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:50:56,908 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-09 10:50:56,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 67 transitions, 539 flow. Second operand has 18 states, 18 states have (on average 14.11111111111111) internal successors, (254), 18 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:56,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:50:56,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-09 10:50:56,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:50:57,626 INFO L124 PetriNetUnfolderBase]: 1437/2703 cut-off events. [2024-11-09 10:50:57,626 INFO L125 PetriNetUnfolderBase]: For 13459/13496 co-relation queries the response was YES. [2024-11-09 10:50:57,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11491 conditions, 2703 events. 1437/2703 cut-off events. For 13459/13496 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 16115 event pairs, 176 based on Foata normal form. 5/2705 useless extension candidates. Maximal degree in co-relation 8625. Up to 1215 conditions per place. [2024-11-09 10:50:57,644 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 183 selfloop transitions, 79 changer transitions 17/286 dead transitions. [2024-11-09 10:50:57,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 286 transitions, 2784 flow [2024-11-09 10:50:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 10:50:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-09 10:50:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 398 transitions. [2024-11-09 10:50:57,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5414965986394558 [2024-11-09 10:50:57,646 INFO L175 Difference]: Start difference. First operand has 98 places, 67 transitions, 539 flow. Second operand 21 states and 398 transitions. [2024-11-09 10:50:57,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 286 transitions, 2784 flow [2024-11-09 10:50:57,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 286 transitions, 2692 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:50:57,667 INFO L231 Difference]: Finished difference. Result has 122 places, 141 transitions, 1350 flow [2024-11-09 10:50:57,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1350, PETRI_PLACES=122, PETRI_TRANSITIONS=141} [2024-11-09 10:50:57,668 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 86 predicate places. [2024-11-09 10:50:57,668 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 141 transitions, 1350 flow [2024-11-09 10:50:57,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.11111111111111) internal successors, (254), 18 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:50:57,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:50:57,668 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:57,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 10:50:57,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 10:50:57,869 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:50:57,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:50:57,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1561583633, now seen corresponding path program 2 times [2024-11-09 10:50:57,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:50:57,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064070445] [2024-11-09 10:50:57,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:50:57,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:50:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:50:57,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:50:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:50:57,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:50:57,942 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:50:57,943 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2024-11-09 10:50:57,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-09 10:50:57,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-09 10:50:57,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-09 10:50:57,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-09 10:50:57,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-09 10:50:57,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-09 10:50:57,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2024-11-09 10:50:57,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2024-11-09 10:50:57,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2024-11-09 10:50:57,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-09 10:50:57,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-09 10:50:57,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-11-09 10:50:57,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2024-11-09 10:50:57,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:50:57,947 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:50:58,006 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:50:58,006 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:50:58,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:50:58 BasicIcfg [2024-11-09 10:50:58,012 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:50:58,013 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:50:58,013 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:50:58,013 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:50:58,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:50:41" (3/4) ... [2024-11-09 10:50:58,016 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:50:58,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:50:58,017 INFO L158 Benchmark]: Toolchain (without parser) took 17450.54ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 122.8MB in the beginning and 167.3MB in the end (delta: -44.5MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. [2024-11-09 10:50:58,018 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:50:58,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.55ms. Allocated memory is still 159.4MB. Free memory was 122.1MB in the beginning and 108.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 10:50:58,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.37ms. Allocated memory is still 159.4MB. Free memory was 108.7MB in the beginning and 106.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:50:58,018 INFO L158 Benchmark]: Boogie Preprocessor took 44.00ms. Allocated memory is still 159.4MB. Free memory was 106.6MB in the beginning and 104.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:50:58,019 INFO L158 Benchmark]: RCFGBuilder took 712.09ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 92.9MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 10:50:58,019 INFO L158 Benchmark]: TraceAbstraction took 16306.94ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 92.0MB in the beginning and 168.3MB in the end (delta: -76.3MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2024-11-09 10:50:58,019 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 285.2MB. Free memory was 168.3MB in the beginning and 167.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:50:58,021 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.17ms. Allocated memory is still 109.1MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.55ms. Allocated memory is still 159.4MB. Free memory was 122.1MB in the beginning and 108.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.37ms. Allocated memory is still 159.4MB. Free memory was 108.7MB in the beginning and 106.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.00ms. Allocated memory is still 159.4MB. Free memory was 106.6MB in the beginning and 104.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 712.09ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 92.9MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16306.94ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 92.0MB in the beginning and 168.3MB in the end (delta: -76.3MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 285.2MB. Free memory was 168.3MB in the beginning and 167.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, N=1, counter=0, t1=-1] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-2:0}, N=1, counter=0, t1=-1, t2=0] [L48] 1 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L57] 2 int i=0; VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-6, i=0, tmp=-6] [L57] 2 i++ VAL [A={-2:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=-6, i=1] [L57] COND FALSE 2 !(i 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 -> 387879bf92b16ead997b40b3e249348f8a6b399496756f9bc3c41b6dc3c21353 [2024-11-09 10:51:00,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:51:00,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:51:00,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:51:00,893 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:51:00,893 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:51:00,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-09 10:51:02,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:51:02,641 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:51:02,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2024-11-09 10:51:02,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a59a729/b6b3cf95b776415cb0b69fb81952a0d5/FLAGbc559624a [2024-11-09 10:51:02,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3a59a729/b6b3cf95b776415cb0b69fb81952a0d5 [2024-11-09 10:51:02,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:51:02,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:51:02,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:51:02,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:51:02,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:51:02,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:51:02" (1/1) ... [2024-11-09 10:51:02,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1b3fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:02, skipping insertion in model container [2024-11-09 10:51:02,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:51:02" (1/1) ... [2024-11-09 10:51:02,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:51:02,969 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:51:02,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:51:02,999 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:51:03,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:51:03,047 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:51:03,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03 WrapperNode [2024-11-09 10:51:03,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:51:03,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:51:03,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:51:03,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:51:03,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,099 INFO L138 Inliner]: procedures = 25, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 132 [2024-11-09 10:51:03,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:51:03,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:51:03,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:51:03,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:51:03,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,152 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-09 10:51:03,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:51:03,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:51:03,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:51:03,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:51:03,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (1/1) ... [2024-11-09 10:51:03,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:51:03,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:51:03,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:51:03,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:51:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:51:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:51:03,264 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:51:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:51:03,264 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:51:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:51:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:51:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:51:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:51:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:51:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:51:03,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:51:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:51:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:51:03,268 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:51:03,386 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:51:03,388 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:51:03,801 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:51:03,802 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:51:04,091 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:51:04,091 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 10:51:04,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:51:04 BoogieIcfgContainer [2024-11-09 10:51:04,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:51:04,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:51:04,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:51:04,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:51:04,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:51:02" (1/3) ... [2024-11-09 10:51:04,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaa1685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:51:04, skipping insertion in model container [2024-11-09 10:51:04,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:51:03" (2/3) ... [2024-11-09 10:51:04,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaa1685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:51:04, skipping insertion in model container [2024-11-09 10:51:04,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:51:04" (3/3) ... [2024-11-09 10:51:04,103 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-11-09 10:51:04,119 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:51:04,119 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 10:51:04,119 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:51:04,184 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:51:04,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 84 flow [2024-11-09 10:51:04,246 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2024-11-09 10:51:04,246 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:51:04,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-11-09 10:51:04,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 84 flow [2024-11-09 10:51:04,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 32 transitions, 76 flow [2024-11-09 10:51:04,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:51:04,277 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;@60c671dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:51:04,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-09 10:51:04,283 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:51:04,283 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-09 10:51:04,283 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:51:04,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:04,284 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:51:04,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:04,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash 446122, now seen corresponding path program 1 times [2024-11-09 10:51:04,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:04,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533280134] [2024-11-09 10:51:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:04,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:04,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:04,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:04,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:51:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:04,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:51:04,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:04,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-09 10:51:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:04,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:04,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:04,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533280134] [2024-11-09 10:51:04,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533280134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:04,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:04,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:51:04,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525237691] [2024-11-09 10:51:04,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:04,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:51:04,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:04,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:51:04,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:51:04,542 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:51:04,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:04,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:04,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:51:04,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:04,662 INFO L124 PetriNetUnfolderBase]: 62/153 cut-off events. [2024-11-09 10:51:04,662 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 10:51:04,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 153 events. 62/153 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 603 event pairs, 42 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 240. Up to 109 conditions per place. [2024-11-09 10:51:04,666 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 17 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2024-11-09 10:51:04,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 108 flow [2024-11-09 10:51:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:51:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:51:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-09 10:51:04,676 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-09 10:51:04,677 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 3 states and 60 transitions. [2024-11-09 10:51:04,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 108 flow [2024-11-09 10:51:04,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:51:04,682 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2024-11-09 10:51:04,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-11-09 10:51:04,691 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-11-09 10:51:04,692 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2024-11-09 10:51:04,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:04,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:04,692 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:51:04,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:51:04,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:04,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:04,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:04,895 INFO L85 PathProgramCache]: Analyzing trace with hash 446123, now seen corresponding path program 1 times [2024-11-09 10:51:04,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:04,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019458772] [2024-11-09 10:51:04,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:04,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:04,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:04,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:04,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:51:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:04,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:51:04,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:05,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-09 10:51:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:05,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:05,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:05,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019458772] [2024-11-09 10:51:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019458772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:05,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:05,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:51:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711378145] [2024-11-09 10:51:05,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:05,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:51:05,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:05,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:51:05,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:51:05,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:51:05,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:05,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:05,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:51:05,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:05,337 INFO L124 PetriNetUnfolderBase]: 63/156 cut-off events. [2024-11-09 10:51:05,338 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:51:05,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 156 events. 63/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 617 event pairs, 42 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 260. Up to 114 conditions per place. [2024-11-09 10:51:05,340 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-11-09 10:51:05,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 120 flow [2024-11-09 10:51:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:51:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:51:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2024-11-09 10:51:05,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-09 10:51:05,344 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 4 states and 76 transitions. [2024-11-09 10:51:05,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 120 flow [2024-11-09 10:51:05,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:51:05,349 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 89 flow [2024-11-09 10:51:05,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2024-11-09 10:51:05,350 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2024-11-09 10:51:05,350 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 89 flow [2024-11-09 10:51:05,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:05,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:05,350 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-09 10:51:05,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:51:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:05,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:05,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash 428737876, now seen corresponding path program 1 times [2024-11-09 10:51:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:05,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663639928] [2024-11-09 10:51:05,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:05,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:05,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:05,557 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:05,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:51:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:05,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:51:05,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:05,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-09 10:51:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:05,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:06,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:06,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663639928] [2024-11-09 10:51:06,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663639928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:06,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-09 10:51:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678443665] [2024-11-09 10:51:06,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:06,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:51:06,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:06,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:51:06,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:51:06,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:51:06,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 89 flow. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:06,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:06,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:51:06,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:06,799 INFO L124 PetriNetUnfolderBase]: 66/165 cut-off events. [2024-11-09 10:51:06,800 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:51:06,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 165 events. 66/165 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 677 event pairs, 42 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 267. Up to 117 conditions per place. [2024-11-09 10:51:06,802 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 19 selfloop transitions, 13 changer transitions 0/41 dead transitions. [2024-11-09 10:51:06,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 189 flow [2024-11-09 10:51:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:51:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:51:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-11-09 10:51:06,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-11-09 10:51:06,805 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 89 flow. Second operand 10 states and 165 transitions. [2024-11-09 10:51:06,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 189 flow [2024-11-09 10:51:06,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:51:06,811 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 166 flow [2024-11-09 10:51:06,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=166, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2024-11-09 10:51:06,812 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2024-11-09 10:51:06,812 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 166 flow [2024-11-09 10:51:06,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:06,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:06,813 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:51:06,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:51:07,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:07,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:07,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash 407994266, now seen corresponding path program 1 times [2024-11-09 10:51:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:07,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82105738] [2024-11-09 10:51:07,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:07,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:07,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:07,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:07,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:51:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:07,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:51:07,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:07,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-09 10:51:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:07,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:07,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82105738] [2024-11-09 10:51:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82105738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:07,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:51:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721787814] [2024-11-09 10:51:07,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:07,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:51:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:07,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:51:07,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:51:07,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-09 10:51:07,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:07,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:07,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-09 10:51:07,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:07,236 INFO L124 PetriNetUnfolderBase]: 66/155 cut-off events. [2024-11-09 10:51:07,236 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-09 10:51:07,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 155 events. 66/155 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 575 event pairs, 42 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 297. Up to 112 conditions per place. [2024-11-09 10:51:07,238 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 25 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2024-11-09 10:51:07,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 224 flow [2024-11-09 10:51:07,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:51:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:51:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-11-09 10:51:07,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-11-09 10:51:07,240 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 166 flow. Second operand 4 states and 65 transitions. [2024-11-09 10:51:07,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 224 flow [2024-11-09 10:51:07,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 194 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-11-09 10:51:07,242 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 144 flow [2024-11-09 10:51:07,243 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2024-11-09 10:51:07,243 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2024-11-09 10:51:07,243 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 144 flow [2024-11-09 10:51:07,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:07,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:07,244 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:51:07,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 10:51:07,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:07,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:07,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:07,450 INFO L85 PathProgramCache]: Analyzing trace with hash 407994267, now seen corresponding path program 1 times [2024-11-09 10:51:07,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:07,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159701616] [2024-11-09 10:51:07,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:07,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:07,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:07,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:07,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:51:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:07,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:51:07,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:07,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-09 10:51:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:07,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:07,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:07,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159701616] [2024-11-09 10:51:07,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159701616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:07,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:07,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:51:07,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310242626] [2024-11-09 10:51:07,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:07,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:51:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:07,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:51:07,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:51:07,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-09 10:51:07,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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-11-09 10:51:07,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:07,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-09 10:51:07,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:08,031 INFO L124 PetriNetUnfolderBase]: 155/314 cut-off events. [2024-11-09 10:51:08,031 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-09 10:51:08,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 314 events. 155/314 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1304 event pairs, 66 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 600. Up to 170 conditions per place. [2024-11-09 10:51:08,037 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 41 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2024-11-09 10:51:08,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 288 flow [2024-11-09 10:51:08,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:51:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:51:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-11-09 10:51:08,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-09 10:51:08,039 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 144 flow. Second operand 6 states and 114 transitions. [2024-11-09 10:51:08,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 288 flow [2024-11-09 10:51:08,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:51:08,044 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 186 flow [2024-11-09 10:51:08,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-11-09 10:51:08,045 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2024-11-09 10:51:08,045 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 186 flow [2024-11-09 10:51:08,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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-11-09 10:51:08,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:08,046 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:08,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:51:08,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:08,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:08,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:08,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1231725768, now seen corresponding path program 1 times [2024-11-09 10:51:08,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:08,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519021535] [2024-11-09 10:51:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:08,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:08,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:08,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:08,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:51:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:08,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:51:08,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:08,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-09 10:51:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:08,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:08,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:08,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519021535] [2024-11-09 10:51:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519021535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:08,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:51:08,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216692400] [2024-11-09 10:51:08,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:08,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:51:08,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:08,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:51:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:51:08,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-09 10:51:08,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:08,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:08,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-09 10:51:08,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:08,825 INFO L124 PetriNetUnfolderBase]: 265/500 cut-off events. [2024-11-09 10:51:08,825 INFO L125 PetriNetUnfolderBase]: For 190/219 co-relation queries the response was YES. [2024-11-09 10:51:08,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 500 events. 265/500 cut-off events. For 190/219 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2151 event pairs, 114 based on Foata normal form. 20/478 useless extension candidates. Maximal degree in co-relation 1195. Up to 289 conditions per place. [2024-11-09 10:51:08,830 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 47 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2024-11-09 10:51:08,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 384 flow [2024-11-09 10:51:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:51:08,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:51:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-11-09 10:51:08,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-09 10:51:08,832 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 186 flow. Second operand 6 states and 112 transitions. [2024-11-09 10:51:08,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 384 flow [2024-11-09 10:51:08,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 363 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:51:08,836 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 220 flow [2024-11-09 10:51:08,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-11-09 10:51:08,837 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2024-11-09 10:51:08,837 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 220 flow [2024-11-09 10:51:08,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:08,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:08,839 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:08,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:51:09,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:09,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:09,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:09,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1898326016, now seen corresponding path program 1 times [2024-11-09 10:51:09,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:09,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661239026] [2024-11-09 10:51:09,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:09,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:09,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:09,045 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:09,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:51:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:09,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 10:51:09,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:09,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-09 10:51:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:09,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:09,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:09,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661239026] [2024-11-09 10:51:09,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661239026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:09,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:09,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:51:09,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95284714] [2024-11-09 10:51:09,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:09,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:51:09,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:09,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:51:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:51:09,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-09 10:51:09,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-11-09 10:51:09,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:09,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-09 10:51:09,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:09,557 INFO L124 PetriNetUnfolderBase]: 222/484 cut-off events. [2024-11-09 10:51:09,557 INFO L125 PetriNetUnfolderBase]: For 314/346 co-relation queries the response was YES. [2024-11-09 10:51:09,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 484 events. 222/484 cut-off events. For 314/346 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2288 event pairs, 139 based on Foata normal form. 32/502 useless extension candidates. Maximal degree in co-relation 1322. Up to 313 conditions per place. [2024-11-09 10:51:09,563 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 48 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2024-11-09 10:51:09,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 379 flow [2024-11-09 10:51:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:51:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:51:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-09 10:51:09,565 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6342857142857142 [2024-11-09 10:51:09,565 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 220 flow. Second operand 5 states and 111 transitions. [2024-11-09 10:51:09,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 379 flow [2024-11-09 10:51:09,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 360 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:51:09,573 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 242 flow [2024-11-09 10:51:09,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-11-09 10:51:09,574 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2024-11-09 10:51:09,575 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 242 flow [2024-11-09 10:51:09,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-11-09 10:51:09,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:09,576 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-11-09 10:51:09,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:51:09,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:09,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:09,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:09,778 INFO L85 PathProgramCache]: Analyzing trace with hash 53461967, now seen corresponding path program 2 times [2024-11-09 10:51:09,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:09,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477813696] [2024-11-09 10:51:09,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:51:09,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:09,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:09,782 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:09,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 10:51:09,836 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:51:09,837 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:51:09,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:51:09,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:09,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-09 10:51:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:10,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:10,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:10,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477813696] [2024-11-09 10:51:10,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477813696] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:10,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:10,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-09 10:51:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65486731] [2024-11-09 10:51:10,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:10,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:51:10,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:10,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:51:10,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:51:11,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:51:11,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 242 flow. Second operand has 14 states, 14 states have (on average 14.571428571428571) internal successors, (204), 14 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:11,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:11,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:51:11,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:12,836 INFO L124 PetriNetUnfolderBase]: 228/510 cut-off events. [2024-11-09 10:51:12,836 INFO L125 PetriNetUnfolderBase]: For 631/680 co-relation queries the response was YES. [2024-11-09 10:51:12,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 510 events. 228/510 cut-off events. For 631/680 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2437 event pairs, 148 based on Foata normal form. 18/506 useless extension candidates. Maximal degree in co-relation 1457. Up to 366 conditions per place. [2024-11-09 10:51:12,842 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 27 selfloop transitions, 31 changer transitions 0/67 dead transitions. [2024-11-09 10:51:12,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 448 flow [2024-11-09 10:51:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 10:51:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-09 10:51:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 342 transitions. [2024-11-09 10:51:12,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44415584415584414 [2024-11-09 10:51:12,845 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 242 flow. Second operand 22 states and 342 transitions. [2024-11-09 10:51:12,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 448 flow [2024-11-09 10:51:12,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 443 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:51:12,850 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 419 flow [2024-11-09 10:51:12,850 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=419, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-11-09 10:51:12,853 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 44 predicate places. [2024-11-09 10:51:12,854 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 419 flow [2024-11-09 10:51:12,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.571428571428571) internal successors, (204), 14 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:12,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:12,854 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:12,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 10:51:13,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:13,058 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:13,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash 311460151, now seen corresponding path program 1 times [2024-11-09 10:51:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:13,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040411114] [2024-11-09 10:51:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:13,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:13,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:13,060 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:13,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 10:51:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:13,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:51:13,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:13,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-09 10:51:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:51:13,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:51:13,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:13,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040411114] [2024-11-09 10:51:13,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040411114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:13,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:13,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-09 10:51:13,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420377542] [2024-11-09 10:51:13,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:13,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:51:13,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:13,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:51:13,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:51:14,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-09 10:51:14,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 419 flow. Second operand has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:14,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:14,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-09 10:51:14,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:15,471 INFO L124 PetriNetUnfolderBase]: 573/1089 cut-off events. [2024-11-09 10:51:15,471 INFO L125 PetriNetUnfolderBase]: For 1016/1095 co-relation queries the response was YES. [2024-11-09 10:51:15,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3418 conditions, 1089 events. 573/1089 cut-off events. For 1016/1095 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5035 event pairs, 96 based on Foata normal form. 85/1161 useless extension candidates. Maximal degree in co-relation 3363. Up to 274 conditions per place. [2024-11-09 10:51:15,481 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 130 selfloop transitions, 30 changer transitions 0/167 dead transitions. [2024-11-09 10:51:15,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 167 transitions, 1170 flow [2024-11-09 10:51:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:51:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:51:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 262 transitions. [2024-11-09 10:51:15,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5758241758241758 [2024-11-09 10:51:15,485 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 419 flow. Second operand 13 states and 262 transitions. [2024-11-09 10:51:15,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 167 transitions, 1170 flow [2024-11-09 10:51:15,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 167 transitions, 1090 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-11-09 10:51:15,492 INFO L231 Difference]: Finished difference. Result has 87 places, 78 transitions, 497 flow [2024-11-09 10:51:15,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=497, PETRI_PLACES=87, PETRI_TRANSITIONS=78} [2024-11-09 10:51:15,493 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 51 predicate places. [2024-11-09 10:51:15,493 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 78 transitions, 497 flow [2024-11-09 10:51:15,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.571428571428571) internal successors, (190), 14 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:15,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:15,493 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:15,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 10:51:15,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:15,695 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:15,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:15,695 INFO L85 PathProgramCache]: Analyzing trace with hash 134715428, now seen corresponding path program 1 times [2024-11-09 10:51:15,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:15,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776186820] [2024-11-09 10:51:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:15,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:15,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:15,699 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:15,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 10:51:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:15,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:51:15,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:15,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-09 10:51:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:51:16,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:51:16,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:16,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776186820] [2024-11-09 10:51:16,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776186820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:16,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:16,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-09 10:51:16,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055387347] [2024-11-09 10:51:16,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:16,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:51:16,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:51:16,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:51:16,860 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-09 10:51:16,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 78 transitions, 497 flow. Second operand has 14 states, 14 states have (on average 13.857142857142858) internal successors, (194), 14 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:16,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:16,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-09 10:51:16,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:18,316 INFO L124 PetriNetUnfolderBase]: 1079/1956 cut-off events. [2024-11-09 10:51:18,317 INFO L125 PetriNetUnfolderBase]: For 4300/4462 co-relation queries the response was YES. [2024-11-09 10:51:18,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7201 conditions, 1956 events. 1079/1956 cut-off events. For 4300/4462 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9738 event pairs, 223 based on Foata normal form. 98/2004 useless extension candidates. Maximal degree in co-relation 7147. Up to 529 conditions per place. [2024-11-09 10:51:18,337 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 185 selfloop transitions, 29 changer transitions 2/227 dead transitions. [2024-11-09 10:51:18,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 227 transitions, 2011 flow [2024-11-09 10:51:18,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:51:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:51:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2024-11-09 10:51:18,340 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2024-11-09 10:51:18,340 INFO L175 Difference]: Start difference. First operand has 87 places, 78 transitions, 497 flow. Second operand 13 states and 252 transitions. [2024-11-09 10:51:18,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 227 transitions, 2011 flow [2024-11-09 10:51:18,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 227 transitions, 1828 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-11-09 10:51:18,380 INFO L231 Difference]: Finished difference. Result has 99 places, 89 transitions, 620 flow [2024-11-09 10:51:18,383 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=620, PETRI_PLACES=99, PETRI_TRANSITIONS=89} [2024-11-09 10:51:18,384 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 63 predicate places. [2024-11-09 10:51:18,384 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 89 transitions, 620 flow [2024-11-09 10:51:18,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.857142857142858) internal successors, (194), 14 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:18,384 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:18,384 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:18,390 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-11-09 10:51:18,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:18,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:18,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash 321109837, now seen corresponding path program 1 times [2024-11-09 10:51:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:18,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909063908] [2024-11-09 10:51:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:18,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:18,587 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:18,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 10:51:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:18,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:51:18,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:18,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:18,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:51:18,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:18,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909063908] [2024-11-09 10:51:18,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909063908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:51:18,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:51:18,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:51:18,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626845773] [2024-11-09 10:51:18,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:51:18,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:51:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:18,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:51:18,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:51:18,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-09 10:51:18,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 89 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:18,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:18,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-09 10:51:18,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:19,031 INFO L124 PetriNetUnfolderBase]: 1266/2368 cut-off events. [2024-11-09 10:51:19,031 INFO L125 PetriNetUnfolderBase]: For 5836/5911 co-relation queries the response was YES. [2024-11-09 10:51:19,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9138 conditions, 2368 events. 1266/2368 cut-off events. For 5836/5911 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 12090 event pairs, 420 based on Foata normal form. 2/2326 useless extension candidates. Maximal degree in co-relation 9079. Up to 1823 conditions per place. [2024-11-09 10:51:19,051 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 81 selfloop transitions, 3 changer transitions 4/104 dead transitions. [2024-11-09 10:51:19,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 104 transitions, 881 flow [2024-11-09 10:51:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:51:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:51:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-09 10:51:19,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2024-11-09 10:51:19,052 INFO L175 Difference]: Start difference. First operand has 99 places, 89 transitions, 620 flow. Second operand 3 states and 71 transitions. [2024-11-09 10:51:19,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 104 transitions, 881 flow [2024-11-09 10:51:19,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 104 transitions, 843 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-09 10:51:19,061 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 575 flow [2024-11-09 10:51:19,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2024-11-09 10:51:19,061 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 62 predicate places. [2024-11-09 10:51:19,062 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 575 flow [2024-11-09 10:51:19,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:19,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:19,062 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:19,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 10:51:19,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:19,263 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:19,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:19,263 INFO L85 PathProgramCache]: Analyzing trace with hash 869469909, now seen corresponding path program 1 times [2024-11-09 10:51:19,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:19,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478088430] [2024-11-09 10:51:19,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:19,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:19,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:19,267 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:19,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 10:51:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:19,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:51:19,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:19,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:19,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478088430] [2024-11-09 10:51:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478088430] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:19,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-09 10:51:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636297482] [2024-11-09 10:51:19,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:19,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:51:19,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:51:19,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:51:19,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:51:19,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 575 flow. Second operand has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 12 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:19,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:19,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:51:19,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:20,348 INFO L124 PetriNetUnfolderBase]: 2113/3950 cut-off events. [2024-11-09 10:51:20,348 INFO L125 PetriNetUnfolderBase]: For 9461/9775 co-relation queries the response was YES. [2024-11-09 10:51:20,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15215 conditions, 3950 events. 2113/3950 cut-off events. For 9461/9775 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 24262 event pairs, 662 based on Foata normal form. 88/3882 useless extension candidates. Maximal degree in co-relation 15160. Up to 991 conditions per place. [2024-11-09 10:51:20,385 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 134 selfloop transitions, 23 changer transitions 0/171 dead transitions. [2024-11-09 10:51:20,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 171 transitions, 1427 flow [2024-11-09 10:51:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:51:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:51:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-11-09 10:51:20,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-11-09 10:51:20,387 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 575 flow. Second operand 10 states and 195 transitions. [2024-11-09 10:51:20,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 171 transitions, 1427 flow [2024-11-09 10:51:20,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 171 transitions, 1380 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-11-09 10:51:20,405 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 653 flow [2024-11-09 10:51:20,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=653, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-11-09 10:51:20,406 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 67 predicate places. [2024-11-09 10:51:20,406 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 653 flow [2024-11-09 10:51:20,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 12 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:20,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:20,407 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:20,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 10:51:20,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:20,608 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:20,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:20,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1385154367, now seen corresponding path program 1 times [2024-11-09 10:51:20,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:20,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722819693] [2024-11-09 10:51:20,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:20,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:20,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:20,610 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:20,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 10:51:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:20,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:51:20,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:51:20,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:51:20,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:20,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722819693] [2024-11-09 10:51:20,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722819693] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:20,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:20,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-09 10:51:20,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728860959] [2024-11-09 10:51:20,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:20,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:51:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:20,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:51:20,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:51:20,943 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:51:20,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 653 flow. Second operand has 12 states, 12 states have (on average 15.166666666666666) internal successors, (182), 12 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:20,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:20,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:51:20,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:21,536 INFO L124 PetriNetUnfolderBase]: 2031/3830 cut-off events. [2024-11-09 10:51:21,536 INFO L125 PetriNetUnfolderBase]: For 9597/9985 co-relation queries the response was YES. [2024-11-09 10:51:21,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14841 conditions, 3830 events. 2031/3830 cut-off events. For 9597/9985 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 24069 event pairs, 616 based on Foata normal form. 138/3824 useless extension candidates. Maximal degree in co-relation 14784. Up to 957 conditions per place. [2024-11-09 10:51:21,568 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 132 selfloop transitions, 23 changer transitions 0/173 dead transitions. [2024-11-09 10:51:21,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 173 transitions, 1462 flow [2024-11-09 10:51:21,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:51:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:51:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-11-09 10:51:21,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5657142857142857 [2024-11-09 10:51:21,571 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 653 flow. Second operand 10 states and 198 transitions. [2024-11-09 10:51:21,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 173 transitions, 1462 flow [2024-11-09 10:51:21,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 173 transitions, 1444 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:51:21,588 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 736 flow [2024-11-09 10:51:21,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=736, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2024-11-09 10:51:21,589 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 72 predicate places. [2024-11-09 10:51:21,589 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 736 flow [2024-11-09 10:51:21,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.166666666666666) internal successors, (182), 12 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:21,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:21,590 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1] [2024-11-09 10:51:21,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 10:51:21,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:21,791 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:21,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash 311580677, now seen corresponding path program 3 times [2024-11-09 10:51:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:21,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003039801] [2024-11-09 10:51:21,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:51:21,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:21,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:21,796 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:21,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 10:51:21,927 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-09 10:51:21,927 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:51:21,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 10:51:21,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:21,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-09 10:51:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:22,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:51:24,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:24,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003039801] [2024-11-09 10:51:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003039801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:24,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2024-11-09 10:51:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822528265] [2024-11-09 10:51:24,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:24,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:51:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:24,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:51:24,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:51:25,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:51:25,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 736 flow. Second operand has 26 states, 26 states have (on average 14.76923076923077) internal successors, (384), 26 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:25,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:25,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:51:25,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:38,510 INFO L124 PetriNetUnfolderBase]: 1707/3372 cut-off events. [2024-11-09 10:51:38,511 INFO L125 PetriNetUnfolderBase]: For 10114/10451 co-relation queries the response was YES. [2024-11-09 10:51:38,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13588 conditions, 3372 events. 1707/3372 cut-off events. For 10114/10451 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 21711 event pairs, 1216 based on Foata normal form. 20/3172 useless extension candidates. Maximal degree in co-relation 13374. Up to 2471 conditions per place. [2024-11-09 10:51:38,531 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 47 selfloop transitions, 66 changer transitions 0/140 dead transitions. [2024-11-09 10:51:38,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 140 transitions, 1190 flow [2024-11-09 10:51:38,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-09 10:51:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-09 10:51:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 695 transitions. [2024-11-09 10:51:38,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43167701863354035 [2024-11-09 10:51:38,536 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 736 flow. Second operand 46 states and 695 transitions. [2024-11-09 10:51:38,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 140 transitions, 1190 flow [2024-11-09 10:51:38,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 140 transitions, 1182 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:51:38,558 INFO L231 Difference]: Finished difference. Result has 161 places, 140 transitions, 1142 flow [2024-11-09 10:51:38,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1142, PETRI_PLACES=161, PETRI_TRANSITIONS=140} [2024-11-09 10:51:38,559 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 125 predicate places. [2024-11-09 10:51:38,560 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 140 transitions, 1142 flow [2024-11-09 10:51:38,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 14.76923076923077) internal successors, (384), 26 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:38,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:38,561 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:38,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 10:51:38,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:38,762 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:38,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash -82775356, now seen corresponding path program 1 times [2024-11-09 10:51:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:38,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106945166] [2024-11-09 10:51:38,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:51:38,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:38,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:38,764 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:51:38,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 10:51:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:51:38,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 10:51:38,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:51:38,954 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 14 treesize of output 6 [2024-11-09 10:51:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:51:38,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:51:39,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:51:39,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2024-11-09 10:51:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:51:39,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:51:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106945166] [2024-11-09 10:51:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106945166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:51:39,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:51:39,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-09 10:51:39,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454967688] [2024-11-09 10:51:39,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:51:39,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:51:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:51:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:51:39,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:51:39,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2024-11-09 10:51:39,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 140 transitions, 1142 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:39,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:51:39,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2024-11-09 10:51:39,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:51:40,432 INFO L124 PetriNetUnfolderBase]: 3550/6570 cut-off events. [2024-11-09 10:51:40,432 INFO L125 PetriNetUnfolderBase]: For 15601/15931 co-relation queries the response was YES. [2024-11-09 10:51:40,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26187 conditions, 6570 events. 3550/6570 cut-off events. For 15601/15931 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 44111 event pairs, 789 based on Foata normal form. 12/6424 useless extension candidates. Maximal degree in co-relation 26098. Up to 3665 conditions per place. [2024-11-09 10:51:40,487 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 245 selfloop transitions, 46 changer transitions 1/316 dead transitions. [2024-11-09 10:51:40,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 316 transitions, 2813 flow [2024-11-09 10:51:40,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:51:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 10:51:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 313 transitions. [2024-11-09 10:51:40,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5589285714285714 [2024-11-09 10:51:40,490 INFO L175 Difference]: Start difference. First operand has 161 places, 140 transitions, 1142 flow. Second operand 16 states and 313 transitions. [2024-11-09 10:51:40,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 316 transitions, 2813 flow [2024-11-09 10:51:40,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 316 transitions, 2651 flow, removed 51 selfloop flow, removed 21 redundant places. [2024-11-09 10:51:40,536 INFO L231 Difference]: Finished difference. Result has 164 places, 185 transitions, 1448 flow [2024-11-09 10:51:40,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1448, PETRI_PLACES=164, PETRI_TRANSITIONS=185} [2024-11-09 10:51:40,537 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 128 predicate places. [2024-11-09 10:51:40,537 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 185 transitions, 1448 flow [2024-11-09 10:51:40,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:51:40,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:51:40,538 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:40,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 10:51:40,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:40,739 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-09 10:51:40,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:51:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash -954219898, now seen corresponding path program 2 times [2024-11-09 10:51:40,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:51:40,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457560311] [2024-11-09 10:51:40,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:51:40,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:51:40,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:51:40,743 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-11-09 10:51:40,744 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-11-09 10:51:40,840 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:51:40,840 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 10:51:40,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:51:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:51:40,976 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:51:40,976 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:51:40,977 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2024-11-09 10:51:40,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-09 10:51:40,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-09 10:51:40,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-09 10:51:40,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-09 10:51:40,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-09 10:51:40,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-09 10:51:40,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2024-11-09 10:51:40,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2024-11-09 10:51:40,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2024-11-09 10:51:40,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-09 10:51:40,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-09 10:51:40,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-11-09 10:51:40,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2024-11-09 10:51:40,987 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-11-09 10:51:41,182 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-11-09 10:51:41,183 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:51:41,228 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:51:41,228 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:51:41,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:51:41 BasicIcfg [2024-11-09 10:51:41,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:51:41,236 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:51:41,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:51:41,237 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:51:41,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:51:04" (3/4) ... [2024-11-09 10:51:41,240 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:51:41,241 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:51:41,242 INFO L158 Benchmark]: Toolchain (without parser) took 38565.58ms. Allocated memory was 77.6MB in the beginning and 595.6MB in the end (delta: 518.0MB). Free memory was 39.5MB in the beginning and 336.1MB in the end (delta: -296.5MB). Peak memory consumption was 222.1MB. Max. memory is 16.1GB. [2024-11-09 10:51:41,242 INFO L158 Benchmark]: CDTParser took 2.24ms. Allocated memory is still 48.2MB. Free memory was 29.4MB in the beginning and 29.3MB in the end (delta: 60.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:51:41,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.90ms. Allocated memory is still 77.6MB. Free memory was 39.3MB in the beginning and 51.0MB in the end (delta: -11.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-09 10:51:41,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.39ms. Allocated memory is still 77.6MB. Free memory was 51.0MB in the beginning and 49.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:51:41,243 INFO L158 Benchmark]: Boogie Preprocessor took 79.61ms. Allocated memory is still 77.6MB. Free memory was 49.1MB in the beginning and 46.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:51:41,243 INFO L158 Benchmark]: RCFGBuilder took 908.09ms. Allocated memory was 77.6MB in the beginning and 115.3MB in the end (delta: 37.7MB). Free memory was 46.2MB in the beginning and 74.5MB in the end (delta: -28.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-09 10:51:41,244 INFO L158 Benchmark]: TraceAbstraction took 37140.14ms. Allocated memory was 115.3MB in the beginning and 595.6MB in the end (delta: 480.2MB). Free memory was 73.7MB in the beginning and 336.1MB in the end (delta: -262.4MB). Peak memory consumption was 217.5MB. Max. memory is 16.1GB. [2024-11-09 10:51:41,244 INFO L158 Benchmark]: Witness Printer took 4.82ms. Allocated memory is still 595.6MB. Free memory is still 336.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:51:41,245 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.24ms. Allocated memory is still 48.2MB. Free memory was 29.4MB in the beginning and 29.3MB in the end (delta: 60.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.90ms. Allocated memory is still 77.6MB. Free memory was 39.3MB in the beginning and 51.0MB in the end (delta: -11.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.39ms. Allocated memory is still 77.6MB. Free memory was 51.0MB in the beginning and 49.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.61ms. Allocated memory is still 77.6MB. Free memory was 49.1MB in the beginning and 46.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 908.09ms. Allocated memory was 77.6MB in the beginning and 115.3MB in the end (delta: 37.7MB). Free memory was 46.2MB in the beginning and 74.5MB in the end (delta: -28.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 37140.14ms. Allocated memory was 115.3MB in the beginning and 595.6MB in the end (delta: 480.2MB). Free memory was 73.7MB in the beginning and 336.1MB in the end (delta: -262.4MB). Peak memory consumption was 217.5MB. Max. memory is 16.1GB. * Witness Printer took 4.82ms. Allocated memory is still 595.6MB. Free memory is still 336.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=0, size=1] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=1, size=1] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, N=1, counter=0, t1=0] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, N=1, counter=0, t1=0, t2=1] [L57] 2 int i=0; VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L48] 1 int i=0; VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=262144, i=0, tmp=262144] [L48] 1 i++ VAL [A={3:0}, N=1, \old(_argptr)={0:0}, _argptr={0:0}, counter=262144, i=1] [L48] COND FALSE 1 !(i