./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:41:29,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:41:29,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:41:29,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:41:29,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:41:29,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:41:29,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:41:29,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:41:29,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:41:29,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:41:29,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:41:29,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:41:29,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:41:29,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:41:29,450 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:41:29,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:41:29,450 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:41:29,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:41:29,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:41:29,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:41:29,451 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:41:29,455 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:41:29,456 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:41:29,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:41:29,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:41:29,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:41:29,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:41:29,456 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:41:29,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:41:29,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:41:29,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:41:29,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:41:29,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:41:29,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:41:29,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:41:29,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:41:29,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:41:29,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:41:29,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:41:29,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:41:29,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:41:29,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:41:29,459 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 -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2024-11-09 10:41:29,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:41:29,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:41:29,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:41:29,738 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:41:29,739 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:41:29,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2024-11-09 10:41:31,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:41:31,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:41:31,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2024-11-09 10:41:31,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba2f14d5/b75dcbff9eb645a88ebe80a736296a30/FLAGc97ea113d [2024-11-09 10:41:31,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba2f14d5/b75dcbff9eb645a88ebe80a736296a30 [2024-11-09 10:41:31,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:41:31,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:41:31,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:41:31,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:41:31,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:41:31,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:41:31" (1/1) ... [2024-11-09 10:41:31,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13592932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:31, skipping insertion in model container [2024-11-09 10:41:31,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:41:31" (1/1) ... [2024-11-09 10:41:31,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:41:31,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:41:31,969 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:41:32,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:41:32,086 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:41:32,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32 WrapperNode [2024-11-09 10:41:32,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:41:32,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:41:32,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:41:32,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:41:32,097 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:41:32" (1/1) ... [2024-11-09 10:41:32,114 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:41:32" (1/1) ... [2024-11-09 10:41:32,142 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2024-11-09 10:41:32,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:41:32,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:41:32,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:41:32,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:41:32,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32" (1/1) ... [2024-11-09 10:41:32,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32" (1/1) ... [2024-11-09 10:41:32,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32" (1/1) ... [2024-11-09 10:41:32,181 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2024-11-09 10:41:32,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32" (1/1) ... [2024-11-09 10:41:32,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32" (1/1) ... [2024-11-09 10:41:32,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32" (1/1) ... [2024-11-09 10:41:32,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32" (1/1) ... [2024-11-09 10:41:32,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32" (1/1) ... [2024-11-09 10:41:32,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32" (1/1) ... [2024-11-09 10:41:32,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:41:32,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:41:32,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:41:32,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:41:32,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32" (1/1) ... [2024-11-09 10:41:32,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:41:32,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:32,264 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:41:32,274 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:41:32,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:41:32,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:41:32,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:41:32,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 10:41:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 10:41:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:41:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:41:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:41:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 10:41:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 10:41:32,323 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:41:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:41:32,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:41:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 10:41:32,325 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 10:41:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:41:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:41:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:41:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:41:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 10:41:32,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 10:41:32,326 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:41:32,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:41:32,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:41:32,328 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:41:32,482 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:41:32,484 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:41:32,760 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:41:32,760 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:41:32,946 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:41:32,947 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-09 10:41:32,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:41:32 BoogieIcfgContainer [2024-11-09 10:41:32,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:41:32,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:41:32,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:41:32,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:41:32,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:41:31" (1/3) ... [2024-11-09 10:41:32,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339be475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:41:32, skipping insertion in model container [2024-11-09 10:41:32,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:32" (2/3) ... [2024-11-09 10:41:32,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339be475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:41:32, skipping insertion in model container [2024-11-09 10:41:32,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:41:32" (3/3) ... [2024-11-09 10:41:32,954 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2024-11-09 10:41:32,967 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:41:32,967 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 10:41:32,967 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:41:33,010 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 10:41:33,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 60 transitions, 127 flow [2024-11-09 10:41:33,077 INFO L124 PetriNetUnfolderBase]: 15/91 cut-off events. [2024-11-09 10:41:33,078 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:41:33,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 15/91 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 345 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 55. Up to 4 conditions per place. [2024-11-09 10:41:33,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 60 transitions, 127 flow [2024-11-09 10:41:33,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 60 transitions, 127 flow [2024-11-09 10:41:33,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:33,108 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;@4d8603c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:33,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:33,116 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:33,116 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:33,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:33,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:33,117 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:33,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:33,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash 349125, now seen corresponding path program 1 times [2024-11-09 10:41:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698896266] [2024-11-09 10:41:33,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:33,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:41:33,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698896266] [2024-11-09 10:41:33,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698896266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:33,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:33,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073091230] [2024-11-09 10:41:33,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:33,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:33,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:33,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:33,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:33,574 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2024-11-09 10:41:33,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:33,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:33,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2024-11-09 10:41:33,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:33,774 INFO L124 PetriNetUnfolderBase]: 136/437 cut-off events. [2024-11-09 10:41:33,775 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:41:33,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 437 events. 136/437 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2199 event pairs, 117 based on Foata normal form. 94/512 useless extension candidates. Maximal degree in co-relation 700. Up to 272 conditions per place. [2024-11-09 10:41:33,780 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 34 selfloop transitions, 2 changer transitions 1/56 dead transitions. [2024-11-09 10:41:33,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 193 flow [2024-11-09 10:41:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-09 10:41:33,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-11-09 10:41:33,795 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 127 flow. Second operand 3 states and 112 transitions. [2024-11-09 10:41:33,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 193 flow [2024-11-09 10:41:33,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:41:33,804 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 103 flow [2024-11-09 10:41:33,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2024-11-09 10:41:33,811 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-09 10:41:33,812 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 103 flow [2024-11-09 10:41:33,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:33,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:33,812 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:33,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:41:33,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:33,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash 349126, now seen corresponding path program 1 times [2024-11-09 10:41:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:33,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256026717] [2024-11-09 10:41:33,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:33,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:33,960 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:41:33,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:33,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256026717] [2024-11-09 10:41:33,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256026717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:33,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:33,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:33,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090616126] [2024-11-09 10:41:33,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:33,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:33,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:33,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:33,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-11-09 10:41:33,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:41:33,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:33,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-11-09 10:41:33,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:34,104 INFO L124 PetriNetUnfolderBase]: 117/395 cut-off events. [2024-11-09 10:41:34,105 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:41:34,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 395 events. 117/395 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2113 event pairs, 0 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 640. Up to 251 conditions per place. [2024-11-09 10:41:34,110 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 34 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-11-09 10:41:34,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 195 flow [2024-11-09 10:41:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-09 10:41:34,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-09 10:41:34,115 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 103 flow. Second operand 3 states and 104 transitions. [2024-11-09 10:41:34,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 195 flow [2024-11-09 10:41:34,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:41:34,118 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 109 flow [2024-11-09 10:41:34,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2024-11-09 10:41:34,121 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-09 10:41:34,122 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 109 flow [2024-11-09 10:41:34,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:41:34,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:34,123 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:34,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:41:34,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:34,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:34,124 INFO L85 PathProgramCache]: Analyzing trace with hash 312064490, now seen corresponding path program 1 times [2024-11-09 10:41:34,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:34,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372322508] [2024-11-09 10:41:34,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:34,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:34,331 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:41:34,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:34,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372322508] [2024-11-09 10:41:34,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372322508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:34,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936221593] [2024-11-09 10:41:34,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:34,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:34,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:34,336 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:41:34,338 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:41:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:34,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:34,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:34,503 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:41:34,614 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:41:34,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:34,702 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:41:34,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936221593] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:34,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:34,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-11-09 10:41:34,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299068871] [2024-11-09 10:41:34,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:34,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:41:34,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:34,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:41:34,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:41:34,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-11-09 10:41:34,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 109 flow. Second operand has 9 states, 9 states have (on average 23.333333333333332) internal successors, (210), 9 states have internal predecessors, (210), 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:41:34,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:34,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-11-09 10:41:34,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:34,870 INFO L124 PetriNetUnfolderBase]: 27/88 cut-off events. [2024-11-09 10:41:34,871 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-09 10:41:34,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 88 events. 27/88 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 232 event pairs, 0 based on Foata normal form. 20/104 useless extension candidates. Maximal degree in co-relation 160. Up to 57 conditions per place. [2024-11-09 10:41:34,872 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 23 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-11-09 10:41:34,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 128 flow [2024-11-09 10:41:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:41:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:41:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-11-09 10:41:34,878 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-11-09 10:41:34,878 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 109 flow. Second operand 4 states and 111 transitions. [2024-11-09 10:41:34,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 128 flow [2024-11-09 10:41:34,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:41:34,879 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 54 flow [2024-11-09 10:41:34,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2024-11-09 10:41:34,882 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -23 predicate places. [2024-11-09 10:41:34,882 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 54 flow [2024-11-09 10:41:34,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.333333333333332) internal successors, (210), 9 states have internal predecessors, (210), 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:41:34,882 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:34,882 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-09 10:41:34,902 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:41:35,083 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:41:35,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:35,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1084064903, now seen corresponding path program 1 times [2024-11-09 10:41:35,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:35,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499025815] [2024-11-09 10:41:35,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:35,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:35,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:41:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:35,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:41:35,139 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:41:35,140 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:41:35,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:41:35,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:41:35,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-09 10:41:35,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:41:35,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:41:35,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:41:35,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:41:35,144 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:41:35,147 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:41:35,147 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 10:41:35,164 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:41:35,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 85 transitions, 186 flow [2024-11-09 10:41:35,182 INFO L124 PetriNetUnfolderBase]: 27/159 cut-off events. [2024-11-09 10:41:35,182 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 10:41:35,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 159 events. 27/159 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 679 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 95. Up to 6 conditions per place. [2024-11-09 10:41:35,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 85 transitions, 186 flow [2024-11-09 10:41:35,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 85 transitions, 186 flow [2024-11-09 10:41:35,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:35,187 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;@4d8603c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:35,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:35,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:35,190 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:35,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:35,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:35,190 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:35,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:35,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:35,191 INFO L85 PathProgramCache]: Analyzing trace with hash 433530, now seen corresponding path program 1 times [2024-11-09 10:41:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:35,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966470993] [2024-11-09 10:41:35,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:35,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:35,229 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:41:35,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:35,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966470993] [2024-11-09 10:41:35,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966470993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:35,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:35,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12796452] [2024-11-09 10:41:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:35,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:35,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:35,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:35,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:35,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 85 [2024-11-09 10:41:35,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:35,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:35,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 85 [2024-11-09 10:41:35,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:35,984 INFO L124 PetriNetUnfolderBase]: 2991/6066 cut-off events. [2024-11-09 10:41:35,984 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-09 10:41:35,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10951 conditions, 6066 events. 2991/6066 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 45949 event pairs, 2583 based on Foata normal form. 1632/7435 useless extension candidates. Maximal degree in co-relation 8032. Up to 4189 conditions per place. [2024-11-09 10:41:36,069 INFO L140 encePairwiseOnDemand]: 65/85 looper letters, 54 selfloop transitions, 2 changer transitions 1/84 dead transitions. [2024-11-09 10:41:36,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 298 flow [2024-11-09 10:41:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2024-11-09 10:41:36,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2024-11-09 10:41:36,074 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 186 flow. Second operand 3 states and 168 transitions. [2024-11-09 10:41:36,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 298 flow [2024-11-09 10:41:36,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 84 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:41:36,076 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 150 flow [2024-11-09 10:41:36,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2024-11-09 10:41:36,079 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2024-11-09 10:41:36,079 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 150 flow [2024-11-09 10:41:36,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:36,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:36,079 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:36,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:41:36,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:36,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:36,080 INFO L85 PathProgramCache]: Analyzing trace with hash 433531, now seen corresponding path program 1 times [2024-11-09 10:41:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:36,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313819244] [2024-11-09 10:41:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:36,154 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:41:36,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:36,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313819244] [2024-11-09 10:41:36,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313819244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:36,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:36,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:36,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581961872] [2024-11-09 10:41:36,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:36,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:36,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:36,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:36,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:36,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 85 [2024-11-09 10:41:36,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:41:36,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:36,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 85 [2024-11-09 10:41:36,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:36,789 INFO L124 PetriNetUnfolderBase]: 2594/5471 cut-off events. [2024-11-09 10:41:36,790 INFO L125 PetriNetUnfolderBase]: For 135/143 co-relation queries the response was YES. [2024-11-09 10:41:36,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9831 conditions, 5471 events. 2594/5471 cut-off events. For 135/143 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 41717 event pairs, 2574 based on Foata normal form. 1/5163 useless extension candidates. Maximal degree in co-relation 9025. Up to 4168 conditions per place. [2024-11-09 10:41:36,825 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 46 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-11-09 10:41:36,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 268 flow [2024-11-09 10:41:36,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2024-11-09 10:41:36,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2024-11-09 10:41:36,829 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 150 flow. Second operand 3 states and 140 transitions. [2024-11-09 10:41:36,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 268 flow [2024-11-09 10:41:36,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 76 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:41:36,839 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 160 flow [2024-11-09 10:41:36,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2024-11-09 10:41:36,840 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2024-11-09 10:41:36,841 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 160 flow [2024-11-09 10:41:36,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:41:36,841 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:36,841 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:36,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:41:36,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:36,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash 955745000, now seen corresponding path program 1 times [2024-11-09 10:41:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:36,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288883990] [2024-11-09 10:41:36,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:36,946 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:41:36,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:36,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288883990] [2024-11-09 10:41:36,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288883990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:36,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660668335] [2024-11-09 10:41:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:36,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:36,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:36,949 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:41:36,950 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:41:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:37,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:37,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:37,041 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:41:37,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:41:37,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:37,156 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:41:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660668335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:37,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:37,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2024-11-09 10:41:37,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455422769] [2024-11-09 10:41:37,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:37,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:41:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:37,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:41:37,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:41:37,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 85 [2024-11-09 10:41:37,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 31.428571428571427) internal successors, (220), 7 states have internal predecessors, (220), 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:41:37,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:37,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 85 [2024-11-09 10:41:37,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:37,779 INFO L124 PetriNetUnfolderBase]: 2512/5297 cut-off events. [2024-11-09 10:41:37,779 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-11-09 10:41:37,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9596 conditions, 5297 events. 2512/5297 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 41878 event pairs, 97 based on Foata normal form. 120/5220 useless extension candidates. Maximal degree in co-relation 8553. Up to 2919 conditions per place. [2024-11-09 10:41:37,812 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 83 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2024-11-09 10:41:37,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 114 transitions, 428 flow [2024-11-09 10:41:37,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:41:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:41:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-11-09 10:41:37,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5529411764705883 [2024-11-09 10:41:37,814 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 160 flow. Second operand 5 states and 235 transitions. [2024-11-09 10:41:37,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 114 transitions, 428 flow [2024-11-09 10:41:37,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:41:37,817 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 162 flow [2024-11-09 10:41:37,818 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2024-11-09 10:41:37,818 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, 1 predicate places. [2024-11-09 10:41:37,819 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 162 flow [2024-11-09 10:41:37,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.428571428571427) internal successors, (220), 7 states have internal predecessors, (220), 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:41:37,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:37,819 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-11-09 10:41:37,836 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:41:38,020 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:41:38,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:38,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1121806825, now seen corresponding path program 1 times [2024-11-09 10:41:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:38,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191155861] [2024-11-09 10:41:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:38,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:41:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:38,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:41:38,051 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:41:38,051 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:41:38,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:41:38,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:41:38,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-09 10:41:38,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:41:38,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:41:38,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:41:38,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:41:38,054 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:41:38,056 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:41:38,056 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 10:41:38,076 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 10:41:38,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 110 transitions, 247 flow [2024-11-09 10:41:38,096 INFO L124 PetriNetUnfolderBase]: 42/248 cut-off events. [2024-11-09 10:41:38,096 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 10:41:38,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 248 events. 42/248 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1116 event pairs, 1 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 170. Up to 12 conditions per place. [2024-11-09 10:41:38,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 110 transitions, 247 flow [2024-11-09 10:41:38,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 110 transitions, 247 flow [2024-11-09 10:41:38,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:38,102 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;@4d8603c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:38,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:38,104 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:38,104 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:38,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:38,104 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:38,104 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:38,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:38,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash 542760, now seen corresponding path program 1 times [2024-11-09 10:41:38,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:38,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805756969] [2024-11-09 10:41:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:38,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:38,127 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:41:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:38,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805756969] [2024-11-09 10:41:38,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805756969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:38,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82416013] [2024-11-09 10:41:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:38,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:38,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 110 [2024-11-09 10:41:38,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 110 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:41:38,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:38,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 110 [2024-11-09 10:41:38,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:44,746 INFO L124 PetriNetUnfolderBase]: 47447/78707 cut-off events. [2024-11-09 10:41:44,747 INFO L125 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2024-11-09 10:41:44,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145940 conditions, 78707 events. 47447/78707 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 2012. Compared 706973 event pairs, 40780 based on Foata normal form. 23856/99464 useless extension candidates. Maximal degree in co-relation 53254. Up to 57237 conditions per place. [2024-11-09 10:41:45,303 INFO L140 encePairwiseOnDemand]: 84/110 looper letters, 74 selfloop transitions, 2 changer transitions 1/112 dead transitions. [2024-11-09 10:41:45,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 112 transitions, 405 flow [2024-11-09 10:41:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-11-09 10:41:45,306 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2024-11-09 10:41:45,306 INFO L175 Difference]: Start difference. First operand has 92 places, 110 transitions, 247 flow. Second operand 3 states and 224 transitions. [2024-11-09 10:41:45,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 112 transitions, 405 flow [2024-11-09 10:41:45,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 112 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:41:45,315 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 199 flow [2024-11-09 10:41:45,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2024-11-09 10:41:45,316 INFO L277 CegarLoopForPetriNet]: 92 programPoint places, -1 predicate places. [2024-11-09 10:41:45,317 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 199 flow [2024-11-09 10:41:45,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:41:45,318 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:45,318 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:45,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:41:45,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:45,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash 542761, now seen corresponding path program 1 times [2024-11-09 10:41:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:45,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952157497] [2024-11-09 10:41:45,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:45,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:45,537 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:41:45,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:45,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952157497] [2024-11-09 10:41:45,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952157497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:45,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:45,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:45,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674670930] [2024-11-09 10:41:45,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:45,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:45,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:45,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:45,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:45,554 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 110 [2024-11-09 10:41:45,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:45,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:45,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 110 [2024-11-09 10:41:45,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:50,593 INFO L124 PetriNetUnfolderBase]: 40912/69187 cut-off events. [2024-11-09 10:41:50,593 INFO L125 PetriNetUnfolderBase]: For 2262/2336 co-relation queries the response was YES. [2024-11-09 10:41:50,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128547 conditions, 69187 events. 40912/69187 cut-off events. For 2262/2336 co-relation queries the response was YES. Maximal size of possible extension queue 1824. Compared 621202 event pairs, 40771 based on Foata normal form. 1/66026 useless extension candidates. Maximal degree in co-relation 116944. Up to 57216 conditions per place. [2024-11-09 10:41:51,050 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 57 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-11-09 10:41:51,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 95 transitions, 339 flow [2024-11-09 10:41:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2024-11-09 10:41:51,054 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-11-09 10:41:51,054 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 199 flow. Second operand 3 states and 175 transitions. [2024-11-09 10:41:51,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 95 transitions, 339 flow [2024-11-09 10:41:51,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 95 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:41:51,207 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 209 flow [2024-11-09 10:41:51,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2024-11-09 10:41:51,208 INFO L277 CegarLoopForPetriNet]: 92 programPoint places, -1 predicate places. [2024-11-09 10:41:51,208 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 209 flow [2024-11-09 10:41:51,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:41:51,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:51,209 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:51,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:41:51,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:51,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:51,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1243199841, now seen corresponding path program 1 times [2024-11-09 10:41:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:51,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256934120] [2024-11-09 10:41:51,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:51,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:51,311 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:41:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256934120] [2024-11-09 10:41:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256934120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:51,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519168644] [2024-11-09 10:41:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:51,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:51,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:51,315 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:41:51,316 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:41:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:51,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:51,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:51,416 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:41:51,468 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:41:51,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:51,527 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:41:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519168644] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:51,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:51,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2024-11-09 10:41:51,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154951563] [2024-11-09 10:41:51,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:51,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:41:51,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:51,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:41:51,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:41:51,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 110 [2024-11-09 10:41:51,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 209 flow. Second operand has 7 states, 7 states have (on average 39.42857142857143) internal successors, (276), 7 states have internal predecessors, (276), 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:41:51,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:51,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 110 [2024-11-09 10:41:51,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:56,476 INFO L124 PetriNetUnfolderBase]: 40830/70948 cut-off events. [2024-11-09 10:41:56,476 INFO L125 PetriNetUnfolderBase]: For 5828/5828 co-relation queries the response was YES. [2024-11-09 10:41:56,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131037 conditions, 70948 events. 40830/70948 cut-off events. For 5828/5828 co-relation queries the response was YES. Maximal size of possible extension queue 2025. Compared 682926 event pairs, 971 based on Foata normal form. 1120/69953 useless extension candidates. Maximal degree in co-relation 13157. Up to 42067 conditions per place. [2024-11-09 10:41:57,307 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 132 selfloop transitions, 6 changer transitions 0/173 dead transitions. [2024-11-09 10:41:57,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 173 transitions, 663 flow [2024-11-09 10:41:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:41:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:41:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 364 transitions. [2024-11-09 10:41:57,310 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2024-11-09 10:41:57,310 INFO L175 Difference]: Start difference. First operand has 91 places, 85 transitions, 209 flow. Second operand 6 states and 364 transitions. [2024-11-09 10:41:57,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 173 transitions, 663 flow [2024-11-09 10:41:57,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 173 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:41:57,318 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 223 flow [2024-11-09 10:41:57,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2024-11-09 10:41:57,319 INFO L277 CegarLoopForPetriNet]: 92 programPoint places, 2 predicate places. [2024-11-09 10:41:57,320 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 223 flow [2024-11-09 10:41:57,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.42857142857143) internal successors, (276), 7 states have internal predecessors, (276), 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:41:57,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:57,320 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2024-11-09 10:41:57,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:41:57,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:57,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:57,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1252634362, now seen corresponding path program 1 times [2024-11-09 10:41:57,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:57,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245627605] [2024-11-09 10:41:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:57,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:57,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:41:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:57,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:41:57,575 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:41:57,575 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:41:57,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:41:57,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:41:57,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-09 10:41:57,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:41:57,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:41:57,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:41:57,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:41:57,577 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:41:57,578 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:41:57,578 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-09 10:41:57,608 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 10:41:57,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 135 transitions, 310 flow [2024-11-09 10:41:57,639 INFO L124 PetriNetUnfolderBase]: 65/381 cut-off events. [2024-11-09 10:41:57,639 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 10:41:57,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 381 events. 65/381 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1857 event pairs, 6 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 272. Up to 32 conditions per place. [2024-11-09 10:41:57,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 135 transitions, 310 flow [2024-11-09 10:41:57,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 135 transitions, 310 flow [2024-11-09 10:41:57,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:57,646 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;@4d8603c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:57,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:57,647 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:57,647 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:57,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:57,647 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:57,648 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:57,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 10:41:57,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash 676815, now seen corresponding path program 1 times [2024-11-09 10:41:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:57,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148540204] [2024-11-09 10:41:57,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:57,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:57,678 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:41:57,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148540204] [2024-11-09 10:41:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148540204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:57,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669706755] [2024-11-09 10:41:57,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:57,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:57,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:57,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:57,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:57,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 135 [2024-11-09 10:41:57,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 135 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:41:57,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:57,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 135 [2024-11-09 10:41:57,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand