./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.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_02-simple_racefree.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 b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:41:31,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:41:31,397 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:31,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:41:31,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:41:31,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:41:31,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:41:31,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:41:31,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:41:31,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:41:31,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:41:31,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:41:31,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:41:31,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:41:31,440 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:41:31,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:41:31,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:41:31,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:41:31,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:41:31,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:41:31,444 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:41:31,448 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:41:31,449 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:41:31,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:41:31,449 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:41:31,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:41:31,449 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:41:31,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:41:31,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:41:31,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:41:31,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:41:31,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:41:31,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:41:31,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:41:31,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:41:31,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:41:31,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:41:31,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:41:31,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:41:31,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:41:31,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:41:31,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:41:31,455 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 -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2024-11-09 10:41:31,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:41:31,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:41:31,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:41:31,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:41:31,739 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:41:31,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-11-09 10:41:33,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:41:33,498 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:41:33,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-11-09 10:41:33,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d4dd7ef/684b1763321a4135a487b4fce1a4ebbf/FLAG4c2107757 [2024-11-09 10:41:33,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d4dd7ef/684b1763321a4135a487b4fce1a4ebbf [2024-11-09 10:41:33,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:41:33,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:41:33,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:41:33,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:41:33,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:41:33,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:41:33" (1/1) ... [2024-11-09 10:41:33,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a830cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:33, skipping insertion in model container [2024-11-09 10:41:33,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:41:33" (1/1) ... [2024-11-09 10:41:33,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:41:33,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:41:33,988 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:41:34,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:41:34,093 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:41:34,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:34 WrapperNode [2024-11-09 10:41:34,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:41:34,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:41:34,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:41:34,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:41:34,101 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:34" (1/1) ... [2024-11-09 10:41:34,115 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:34" (1/1) ... [2024-11-09 10:41:34,140 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2024-11-09 10:41:34,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:41:34,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:41:34,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:41:34,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:41:34,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:34" (1/1) ... [2024-11-09 10:41:34,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:34" (1/1) ... [2024-11-09 10:41:34,157 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:34" (1/1) ... [2024-11-09 10:41:34,175 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2024-11-09 10:41:34,183 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:34" (1/1) ... [2024-11-09 10:41:34,183 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:34" (1/1) ... [2024-11-09 10:41:34,194 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:34" (1/1) ... [2024-11-09 10:41:34,200 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:34" (1/1) ... [2024-11-09 10:41:34,204 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:34" (1/1) ... [2024-11-09 10:41:34,208 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:34" (1/1) ... [2024-11-09 10:41:34,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:41:34,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:41:34,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:41:34,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:41:34,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:34" (1/1) ... [2024-11-09 10:41:34,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:41:34,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:34,265 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:34,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:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:41:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:41:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:41:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 10:41:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:41:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:41:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:41:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 10:41:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:41:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:41:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:41:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 10:41:34,322 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 10:41:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:41:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:41:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:41:34,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:41:34,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 10:41:34,323 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:41:34,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:41:34,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:41:34,326 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:34,458 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:41:34,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:41:34,753 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:41:34,753 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:41:35,189 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:41:35,190 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-09 10:41:35,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:41:35 BoogieIcfgContainer [2024-11-09 10:41:35,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:41:35,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:41:35,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:41:35,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:41:35,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:41:33" (1/3) ... [2024-11-09 10:41:35,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4408ae12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:41:35, skipping insertion in model container [2024-11-09 10:41:35,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:41:34" (2/3) ... [2024-11-09 10:41:35,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4408ae12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:41:35, skipping insertion in model container [2024-11-09 10:41:35,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:41:35" (3/3) ... [2024-11-09 10:41:35,201 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2024-11-09 10:41:35,217 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:41:35,217 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 10:41:35,218 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:41:35,263 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 10:41:35,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 60 transitions, 127 flow [2024-11-09 10:41:35,340 INFO L124 PetriNetUnfolderBase]: 15/91 cut-off events. [2024-11-09 10:41:35,341 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:41:35,345 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:35,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 60 transitions, 127 flow [2024-11-09 10:41:35,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 60 transitions, 127 flow [2024-11-09 10:41:35,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:35,366 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;@7de01e8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:35,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:35,372 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:35,372 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:35,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:35,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:35,373 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:35,374 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,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:35,379 INFO L85 PathProgramCache]: Analyzing trace with hash 448425, now seen corresponding path program 1 times [2024-11-09 10:41:35,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:35,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779978762] [2024-11-09 10:41:35,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:35,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:35,752 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,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:35,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779978762] [2024-11-09 10:41:35,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779978762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:35,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:35,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:35,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775328749] [2024-11-09 10:41:35,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:35,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:35,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:35,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:35,823 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2024-11-09 10:41:35,825 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:35,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:35,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2024-11-09 10:41:35,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:36,028 INFO L124 PetriNetUnfolderBase]: 136/437 cut-off events. [2024-11-09 10:41:36,029 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:41:36,031 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:36,036 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 34 selfloop transitions, 2 changer transitions 1/56 dead transitions. [2024-11-09 10:41:36,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 193 flow [2024-11-09 10:41:36,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-09 10:41:36,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-11-09 10:41:36,051 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:36,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 193 flow [2024-11-09 10:41:36,054 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:36,056 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 103 flow [2024-11-09 10:41:36,059 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:36,063 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-09 10:41:36,064 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 103 flow [2024-11-09 10:41:36,064 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:36,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:36,065 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:36,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:41:36,066 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,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash 448426, now seen corresponding path program 1 times [2024-11-09 10:41:36,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:36,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374654266] [2024-11-09 10:41:36,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:36,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:36,321 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,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374654266] [2024-11-09 10:41:36,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374654266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:36,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:36,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:36,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318706958] [2024-11-09 10:41:36,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:36,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:36,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:36,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:36,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2024-11-09 10:41:36,342 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:36,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:36,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2024-11-09 10:41:36,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:36,473 INFO L124 PetriNetUnfolderBase]: 117/395 cut-off events. [2024-11-09 10:41:36,473 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:41:36,475 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:36,478 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 34 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-11-09 10:41:36,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 195 flow [2024-11-09 10:41:36,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-09 10:41:36,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-09 10:41:36,482 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:36,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 195 flow [2024-11-09 10:41:36,484 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:36,487 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 109 flow [2024-11-09 10:41:36,487 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:36,488 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-09 10:41:36,489 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 109 flow [2024-11-09 10:41:36,489 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:36,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:36,489 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:36,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:41:36,490 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,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:36,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1826464974, now seen corresponding path program 1 times [2024-11-09 10:41:36,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:36,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936563342] [2024-11-09 10:41:36,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:36,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:36,699 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,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:36,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936563342] [2024-11-09 10:41:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936563342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:36,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930488199] [2024-11-09 10:41:36,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:36,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:36,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:36,705 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:36,707 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:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:36,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:36,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:36,948 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,033 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,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:37,112 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,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930488199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:37,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:37,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-11-09 10:41:37,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406352073] [2024-11-09 10:41:37,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:37,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:41:37,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:37,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:41:37,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:41:37,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2024-11-09 10:41:37,182 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:37,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:37,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2024-11-09 10:41:37,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:37,272 INFO L124 PetriNetUnfolderBase]: 27/88 cut-off events. [2024-11-09 10:41:37,272 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-09 10:41:37,273 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:37,274 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 23 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-11-09 10:41:37,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 128 flow [2024-11-09 10:41:37,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:41:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:41:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-11-09 10:41:37,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-11-09 10:41:37,278 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:37,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 128 flow [2024-11-09 10:41:37,279 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:37,279 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 54 flow [2024-11-09 10:41:37,279 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:37,282 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -23 predicate places. [2024-11-09 10:41:37,282 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 54 flow [2024-11-09 10:41:37,282 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:37,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:37,283 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-09 10:41:37,302 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:37,486 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:37,487 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:37,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 785839751, now seen corresponding path program 1 times [2024-11-09 10:41:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:37,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442075530] [2024-11-09 10:41:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:37,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:37,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:41:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:37,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:41:37,558 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:41:37,560 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:41:37,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:41:37,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:41:37,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-09 10:41:37,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:41:37,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:41:37,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:41:37,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:41:37,565 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:41:37,568 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:41:37,569 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 10:41:37,589 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:41:37,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 85 transitions, 186 flow [2024-11-09 10:41:37,604 INFO L124 PetriNetUnfolderBase]: 27/159 cut-off events. [2024-11-09 10:41:37,604 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 10:41:37,605 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:37,606 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 85 transitions, 186 flow [2024-11-09 10:41:37,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 85 transitions, 186 flow [2024-11-09 10:41:37,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:37,609 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;@7de01e8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:37,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:37,611 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:37,612 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:37,612 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:37,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:37,612 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:37,612 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:37,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:37,613 INFO L85 PathProgramCache]: Analyzing trace with hash 532830, now seen corresponding path program 1 times [2024-11-09 10:41:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:37,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627308646] [2024-11-09 10:41:37,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:37,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:37,670 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:37,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:37,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627308646] [2024-11-09 10:41:37,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627308646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:37,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:37,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:37,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485656417] [2024-11-09 10:41:37,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:37,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:37,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:37,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:37,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:37,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 85 [2024-11-09 10:41:37,686 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:37,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:37,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 85 [2024-11-09 10:41:37,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:38,335 INFO L124 PetriNetUnfolderBase]: 2991/6066 cut-off events. [2024-11-09 10:41:38,335 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-09 10:41:38,345 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:38,374 INFO L140 encePairwiseOnDemand]: 65/85 looper letters, 54 selfloop transitions, 2 changer transitions 1/84 dead transitions. [2024-11-09 10:41:38,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 298 flow [2024-11-09 10:41:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2024-11-09 10:41:38,379 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2024-11-09 10:41:38,382 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:38,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 298 flow [2024-11-09 10:41:38,383 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:38,385 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 150 flow [2024-11-09 10:41:38,386 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:38,386 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2024-11-09 10:41:38,386 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 150 flow [2024-11-09 10:41:38,387 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:38,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:38,390 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:38,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:41:38,390 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:38,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:38,391 INFO L85 PathProgramCache]: Analyzing trace with hash 532831, now seen corresponding path program 1 times [2024-11-09 10:41:38,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:38,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934082936] [2024-11-09 10:41:38,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:38,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:38,489 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,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934082936] [2024-11-09 10:41:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934082936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:38,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:38,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566783180] [2024-11-09 10:41:38,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:38,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:38,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:38,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:38,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 85 [2024-11-09 10:41:38,506 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:38,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:38,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 85 [2024-11-09 10:41:38,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:39,150 INFO L124 PetriNetUnfolderBase]: 2594/5471 cut-off events. [2024-11-09 10:41:39,151 INFO L125 PetriNetUnfolderBase]: For 135/143 co-relation queries the response was YES. [2024-11-09 10:41:39,161 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:39,188 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 46 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-11-09 10:41:39,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 268 flow [2024-11-09 10:41:39,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2024-11-09 10:41:39,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2024-11-09 10:41:39,191 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:39,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 268 flow [2024-11-09 10:41:39,199 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:39,201 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 160 flow [2024-11-09 10:41:39,202 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:39,202 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2024-11-09 10:41:39,204 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 160 flow [2024-11-09 10:41:39,204 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:39,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:39,204 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:39,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:41:39,205 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:39,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1824821812, now seen corresponding path program 1 times [2024-11-09 10:41:39,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:39,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669396654] [2024-11-09 10:41:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:39,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:39,352 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:39,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:39,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669396654] [2024-11-09 10:41:39,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669396654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:39,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837516588] [2024-11-09 10:41:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:39,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:39,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:39,355 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:39,357 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:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:39,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:39,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:39,512 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:39,550 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:39,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:39,600 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:39,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837516588] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:39,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:39,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2024-11-09 10:41:39,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475171080] [2024-11-09 10:41:39,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:39,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:41:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:39,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:41:39,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:41:39,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 85 [2024-11-09 10:41:39,649 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:39,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:39,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 85 [2024-11-09 10:41:39,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:40,229 INFO L124 PetriNetUnfolderBase]: 2512/5297 cut-off events. [2024-11-09 10:41:40,230 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-11-09 10:41:40,239 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:40,263 INFO L140 encePairwiseOnDemand]: 81/85 looper letters, 83 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2024-11-09 10:41:40,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 114 transitions, 428 flow [2024-11-09 10:41:40,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:41:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:41:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-11-09 10:41:40,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5529411764705883 [2024-11-09 10:41:40,266 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:40,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 114 transitions, 428 flow [2024-11-09 10:41:40,268 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:40,271 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 162 flow [2024-11-09 10:41:40,271 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:40,272 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, 1 predicate places. [2024-11-09 10:41:40,273 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 162 flow [2024-11-09 10:41:40,273 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:40,273 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:40,274 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-11-09 10:41:40,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:41:40,477 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:40,478 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:40,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:40,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1287858967, now seen corresponding path program 1 times [2024-11-09 10:41:40,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:40,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095559898] [2024-11-09 10:41:40,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:40,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:40,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:41:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:40,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:41:40,532 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:41:40,532 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:41:40,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:41:40,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:41:40,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-09 10:41:40,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:41:40,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:41:40,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:41:40,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:41:40,533 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:41:40,534 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:41:40,534 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 10:41:40,564 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 10:41:40,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 110 transitions, 247 flow [2024-11-09 10:41:40,596 INFO L124 PetriNetUnfolderBase]: 42/248 cut-off events. [2024-11-09 10:41:40,596 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 10:41:40,598 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:40,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 110 transitions, 247 flow [2024-11-09 10:41:40,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 110 transitions, 247 flow [2024-11-09 10:41:40,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:40,605 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;@7de01e8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:40,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:40,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:40,608 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:40,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:40,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:40,608 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:40,608 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:40,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash 642060, now seen corresponding path program 1 times [2024-11-09 10:41:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:40,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043734582] [2024-11-09 10:41:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:40,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:40,667 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:40,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:40,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043734582] [2024-11-09 10:41:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043734582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:40,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:40,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171962694] [2024-11-09 10:41:40,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:40,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:40,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 110 [2024-11-09 10:41:40,680 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:40,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:40,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 110 [2024-11-09 10:41:40,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:47,425 INFO L124 PetriNetUnfolderBase]: 47447/78707 cut-off events. [2024-11-09 10:41:47,425 INFO L125 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2024-11-09 10:41:47,662 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:47,991 INFO L140 encePairwiseOnDemand]: 84/110 looper letters, 74 selfloop transitions, 2 changer transitions 1/112 dead transitions. [2024-11-09 10:41:47,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 112 transitions, 405 flow [2024-11-09 10:41:47,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-11-09 10:41:47,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2024-11-09 10:41:47,993 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:47,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 112 transitions, 405 flow [2024-11-09 10:41:47,999 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:48,001 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 199 flow [2024-11-09 10:41:48,001 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:48,002 INFO L277 CegarLoopForPetriNet]: 92 programPoint places, -1 predicate places. [2024-11-09 10:41:48,005 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 199 flow [2024-11-09 10:41:48,005 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:48,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:48,006 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:48,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:41:48,006 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:48,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:48,007 INFO L85 PathProgramCache]: Analyzing trace with hash 642061, now seen corresponding path program 1 times [2024-11-09 10:41:48,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:48,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816481712] [2024-11-09 10:41:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:48,094 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:48,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:48,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816481712] [2024-11-09 10:41:48,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816481712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:48,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:48,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:48,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369828295] [2024-11-09 10:41:48,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:48,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:48,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:48,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:48,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 110 [2024-11-09 10:41:48,109 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:48,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:48,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 110 [2024-11-09 10:41:48,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:53,097 INFO L124 PetriNetUnfolderBase]: 40912/69187 cut-off events. [2024-11-09 10:41:53,098 INFO L125 PetriNetUnfolderBase]: For 2262/2336 co-relation queries the response was YES. [2024-11-09 10:41:53,256 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:53,573 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 57 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-11-09 10:41:53,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 95 transitions, 339 flow [2024-11-09 10:41:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:41:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:41:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2024-11-09 10:41:53,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-11-09 10:41:53,576 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:53,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 95 transitions, 339 flow [2024-11-09 10:41:53,710 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:53,711 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 209 flow [2024-11-09 10:41:53,712 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:53,712 INFO L277 CegarLoopForPetriNet]: 92 programPoint places, -1 predicate places. [2024-11-09 10:41:53,712 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 209 flow [2024-11-09 10:41:53,713 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:53,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:53,713 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:41:53,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:41:53,713 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:53,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:53,713 INFO L85 PathProgramCache]: Analyzing trace with hash 271200643, now seen corresponding path program 1 times [2024-11-09 10:41:53,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:53,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472398598] [2024-11-09 10:41:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:53,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:53,888 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:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472398598] [2024-11-09 10:41:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472398598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:41:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060540432] [2024-11-09 10:41:53,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:53,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:41:53,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:41:53,892 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:53,893 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:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:54,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:41:54,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:41:54,069 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:54,123 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:54,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:41:54,184 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:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060540432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:41:54,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:41:54,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-11-09 10:41:54,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178495270] [2024-11-09 10:41:54,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:41:54,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:41:54,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:54,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:41:54,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:41:54,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 110 [2024-11-09 10:41:54,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 209 flow. Second operand has 9 states, 9 states have (on average 39.333333333333336) internal successors, (354), 9 states have internal predecessors, (354), 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:54,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:54,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 110 [2024-11-09 10:41:54,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:41:55,636 INFO L124 PetriNetUnfolderBase]: 10557/17688 cut-off events. [2024-11-09 10:41:55,637 INFO L125 PetriNetUnfolderBase]: For 3709/3709 co-relation queries the response was YES. [2024-11-09 10:41:55,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34248 conditions, 17688 events. 10557/17688 cut-off events. For 3709/3709 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 134203 event pairs, 1600 based on Foata normal form. 2220/19764 useless extension candidates. Maximal degree in co-relation 3508. Up to 11100 conditions per place. [2024-11-09 10:41:55,742 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 92 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2024-11-09 10:41:55,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 121 transitions, 462 flow [2024-11-09 10:41:55,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:41:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:41:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 324 transitions. [2024-11-09 10:41:55,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2024-11-09 10:41:55,745 INFO L175 Difference]: Start difference. First operand has 91 places, 85 transitions, 209 flow. Second operand 6 states and 324 transitions. [2024-11-09 10:41:55,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 121 transitions, 462 flow [2024-11-09 10:41:55,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 121 transitions, 458 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:41:55,749 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 154 flow [2024-11-09 10:41:55,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2024-11-09 10:41:55,751 INFO L277 CegarLoopForPetriNet]: 92 programPoint places, -19 predicate places. [2024-11-09 10:41:55,751 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 154 flow [2024-11-09 10:41:55,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.333333333333336) internal successors, (354), 9 states have internal predecessors, (354), 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:55,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:55,752 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2024-11-09 10:41:55,769 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:55,956 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:55,957 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:55,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1468699386, now seen corresponding path program 1 times [2024-11-09 10:41:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:55,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927686725] [2024-11-09 10:41:55,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:55,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:56,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:41:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:41:56,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:41:56,033 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:41:56,033 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:41:56,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 10:41:56,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 10:41:56,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-09 10:41:56,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 10:41:56,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:41:56,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:41:56,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:41:56,034 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:41:56,035 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:41:56,035 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-09 10:41:56,066 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 10:41:56,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 135 transitions, 310 flow [2024-11-09 10:41:56,103 INFO L124 PetriNetUnfolderBase]: 65/381 cut-off events. [2024-11-09 10:41:56,103 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 10:41:56,107 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:56,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 135 transitions, 310 flow [2024-11-09 10:41:56,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 135 transitions, 310 flow [2024-11-09 10:41:56,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:41:56,114 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;@7de01e8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:41:56,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:41:56,116 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:41:56,116 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-09 10:41:56,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:41:56,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:41:56,117 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:41:56,117 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:56,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:41:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash 776115, now seen corresponding path program 1 times [2024-11-09 10:41:56,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:41:56,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295765423] [2024-11-09 10:41:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:41:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:41:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:41:56,180 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:56,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:41:56,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295765423] [2024-11-09 10:41:56,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295765423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:41:56,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:41:56,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:41:56,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978110738] [2024-11-09 10:41:56,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:41:56,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:41:56,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:41:56,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:41:56,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:41:56,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 135 [2024-11-09 10:41:56,196 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:56,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:41:56,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 135 [2024-11-09 10:41:56,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand