./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4864acf28eb3fe42b4a237468061905eb474c41e1edb519c0790cee08cdc91bf --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:42:45,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:42:45,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:42:45,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:42:45,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:42:45,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:42:45,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:42:45,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:42:45,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:42:45,967 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:42:45,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:42:45,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:42:45,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:42:45,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:42:45,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:42:45,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:42:45,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:42:45,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:42:45,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:42:45,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:42:45,970 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:42:45,974 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:42:45,975 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:42:45,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:42:45,975 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:42:45,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:42:45,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:42:45,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:42:45,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:42:45,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:42:45,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:42:45,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:42:45,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:42:45,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:42:45,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:42:45,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:42:45,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:42:45,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:42:45,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:42:45,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:42:45,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:42:45,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:42:45,982 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 -> 4864acf28eb3fe42b4a237468061905eb474c41e1edb519c0790cee08cdc91bf [2024-11-09 10:42:46,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:42:46,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:42:46,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:42:46,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:42:46,245 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:42:46,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-09 10:42:47,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:42:47,959 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:42:47,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-09 10:42:47,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327f4cbda/67c8612e6fe44d1c9ff66c87eb00054d/FLAG74ba06354 [2024-11-09 10:42:47,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327f4cbda/67c8612e6fe44d1c9ff66c87eb00054d [2024-11-09 10:42:47,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:42:47,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:42:47,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:42:47,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:42:47,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:42:47,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:42:47" (1/1) ... [2024-11-09 10:42:47,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5023a146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:47, skipping insertion in model container [2024-11-09 10:42:47,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:42:47" (1/1) ... [2024-11-09 10:42:48,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:42:48,321 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:42:48,334 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:42:48,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:42:48,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:42:48,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:42:48,441 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:42:48,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48 WrapperNode [2024-11-09 10:42:48,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:42:48,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:42:48,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:42:48,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:42:48,449 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:42:48" (1/1) ... [2024-11-09 10:42:48,468 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:42:48" (1/1) ... [2024-11-09 10:42:48,485 INFO L138 Inliner]: procedures = 171, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-11-09 10:42:48,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:42:48,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:42:48,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:42:48,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:42:48,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48" (1/1) ... [2024-11-09 10:42:48,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48" (1/1) ... [2024-11-09 10:42:48,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48" (1/1) ... [2024-11-09 10:42:48,511 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 6, 5, 5, 5]. 26 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 5, 5, 5]. The 2 writes are split as follows [0, 2, 0, 0, 0]. [2024-11-09 10:42:48,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48" (1/1) ... [2024-11-09 10:42:48,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48" (1/1) ... [2024-11-09 10:42:48,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48" (1/1) ... [2024-11-09 10:42:48,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48" (1/1) ... [2024-11-09 10:42:48,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48" (1/1) ... [2024-11-09 10:42:48,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48" (1/1) ... [2024-11-09 10:42:48,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:42:48,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:42:48,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:42:48,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:42:48,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48" (1/1) ... [2024-11-09 10:42:48,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:42:48,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:42:48,602 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:42:48,606 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:42:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:42:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:42:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:42:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 10:42:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 10:42:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:42:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:42:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:42:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 10:42:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 10:42:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:42:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:42:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:42:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 10:42:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 10:42:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:42:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:42:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:42:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:42:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 10:42:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 10:42:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:42:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:42:48,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:42:48,686 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:42:48,837 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:42:48,843 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:42:49,067 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:42:49,067 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:42:49,225 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:42:49,225 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-09 10:42:49,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:42:49 BoogieIcfgContainer [2024-11-09 10:42:49,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:42:49,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:42:49,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:42:49,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:42:49,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:42:47" (1/3) ... [2024-11-09 10:42:49,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23537167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:42:49, skipping insertion in model container [2024-11-09 10:42:49,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:48" (2/3) ... [2024-11-09 10:42:49,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23537167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:42:49, skipping insertion in model container [2024-11-09 10:42:49,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:42:49" (3/3) ... [2024-11-09 10:42:49,238 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_45-escape_racing.i [2024-11-09 10:42:49,255 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:42:49,256 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-09 10:42:49,256 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:42:49,309 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 10:42:49,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 65 transitions, 137 flow [2024-11-09 10:42:49,400 INFO L124 PetriNetUnfolderBase]: 10/64 cut-off events. [2024-11-09 10:42:49,401 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:42:49,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 64 events. 10/64 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 58. Up to 3 conditions per place. [2024-11-09 10:42:49,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 65 transitions, 137 flow [2024-11-09 10:42:49,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 63 transitions, 132 flow [2024-11-09 10:42:49,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:42:49,434 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;@4501e82a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:42:49,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-09 10:42:49,447 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:42:49,450 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-11-09 10:42:49,451 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:42:49,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:49,452 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:49,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:42:49,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2064971934, now seen corresponding path program 1 times [2024-11-09 10:42:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:49,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904950498] [2024-11-09 10:42:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:49,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:49,795 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:42:49,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:49,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904950498] [2024-11-09 10:42:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904950498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:49,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:49,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:42:49,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137700961] [2024-11-09 10:42:49,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:49,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:42:49,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:49,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:42:49,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:42:49,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-09 10:42:49,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:42:49,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:49,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-09 10:42:49,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:49,967 INFO L124 PetriNetUnfolderBase]: 96/385 cut-off events. [2024-11-09 10:42:49,967 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:42:49,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 385 events. 96/385 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1972 event pairs, 96 based on Foata normal form. 74/423 useless extension candidates. Maximal degree in co-relation 592. Up to 215 conditions per place. [2024-11-09 10:42:49,973 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-09 10:42:49,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 156 flow [2024-11-09 10:42:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:42:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:42:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-09 10:42:49,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6102564102564103 [2024-11-09 10:42:49,986 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 132 flow. Second operand 3 states and 119 transitions. [2024-11-09 10:42:49,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 156 flow [2024-11-09 10:42:49,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:42:49,991 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 108 flow [2024-11-09 10:42:49,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-11-09 10:42:49,997 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2024-11-09 10:42:49,997 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 108 flow [2024-11-09 10:42:49,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:42:49,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:49,998 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:49,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:42:49,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:42:50,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2064971935, now seen corresponding path program 1 times [2024-11-09 10:42:50,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:50,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755076889] [2024-11-09 10:42:50,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:50,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:50,124 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:42:50,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:50,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755076889] [2024-11-09 10:42:50,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755076889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:50,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:50,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:42:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746118379] [2024-11-09 10:42:50,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:50,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:42:50,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:50,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:42:50,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:42:50,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-09 10:42:50,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:42:50,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:50,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-09 10:42:50,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:50,237 INFO L124 PetriNetUnfolderBase]: 96/383 cut-off events. [2024-11-09 10:42:50,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:42:50,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 383 events. 96/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1967 event pairs, 96 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 595. Up to 215 conditions per place. [2024-11-09 10:42:50,241 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-09 10:42:50,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 154 flow [2024-11-09 10:42:50,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:42:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:42:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-09 10:42:50,243 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2024-11-09 10:42:50,244 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 108 flow. Second operand 3 states and 109 transitions. [2024-11-09 10:42:50,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 154 flow [2024-11-09 10:42:50,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:42:50,246 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 106 flow [2024-11-09 10:42:50,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-11-09 10:42:50,248 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-09 10:42:50,248 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 106 flow [2024-11-09 10:42:50,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:42:50,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:50,249 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:50,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:42:50,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:42:50,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1468347495, now seen corresponding path program 1 times [2024-11-09 10:42:50,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:50,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294271442] [2024-11-09 10:42:50,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:50,365 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:42:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:50,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294271442] [2024-11-09 10:42:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294271442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:50,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:50,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:42:50,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730939676] [2024-11-09 10:42:50,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:50,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:42:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:50,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:42:50,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:42:50,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-09 10:42:50,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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:42:50,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:50,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-09 10:42:50,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:50,493 INFO L124 PetriNetUnfolderBase]: 96/342 cut-off events. [2024-11-09 10:42:50,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:42:50,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 342 events. 96/342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1630 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 554. Up to 205 conditions per place. [2024-11-09 10:42:50,497 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-11-09 10:42:50,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 178 flow [2024-11-09 10:42:50,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:42:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:42:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-09 10:42:50,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-11-09 10:42:50,501 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 106 flow. Second operand 5 states and 156 transitions. [2024-11-09 10:42:50,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 178 flow [2024-11-09 10:42:50,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:42:50,503 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 102 flow [2024-11-09 10:42:50,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-11-09 10:42:50,504 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-09 10:42:50,504 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 102 flow [2024-11-09 10:42:50,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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:42:50,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:50,505 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:50,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:42:50,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:42:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1468347496, now seen corresponding path program 1 times [2024-11-09 10:42:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:50,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919461337] [2024-11-09 10:42:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:50,621 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:42:50,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:50,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919461337] [2024-11-09 10:42:50,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919461337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:50,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:50,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:42:50,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155276080] [2024-11-09 10:42:50,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:50,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:42:50,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:50,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:42:50,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:42:50,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-09 10:42:50,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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:42:50,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:50,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-09 10:42:50,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:50,778 INFO L124 PetriNetUnfolderBase]: 96/306 cut-off events. [2024-11-09 10:42:50,778 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 10:42:50,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 306 events. 96/306 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1325 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 80. Up to 205 conditions per place. [2024-11-09 10:42:50,782 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2024-11-09 10:42:50,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 174 flow [2024-11-09 10:42:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:42:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:42:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-11-09 10:42:50,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-11-09 10:42:50,784 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 102 flow. Second operand 6 states and 180 transitions. [2024-11-09 10:42:50,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 174 flow [2024-11-09 10:42:50,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:42:50,786 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 94 flow [2024-11-09 10:42:50,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-11-09 10:42:50,787 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2024-11-09 10:42:50,787 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 94 flow [2024-11-09 10:42:50,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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:42:50,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:50,788 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:50,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:42:50,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:42:50,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:50,789 INFO L85 PathProgramCache]: Analyzing trace with hash 762681113, now seen corresponding path program 1 times [2024-11-09 10:42:50,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:50,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003616674] [2024-11-09 10:42:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:50,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:50,833 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:42:50,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:50,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003616674] [2024-11-09 10:42:50,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003616674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:50,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:50,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:42:50,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277168762] [2024-11-09 10:42:50,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:50,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:42:50,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:50,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:42:50,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:42:50,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-09 10:42:50,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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:42:50,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:50,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-09 10:42:50,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:50,954 INFO L124 PetriNetUnfolderBase]: 110/346 cut-off events. [2024-11-09 10:42:50,954 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 10:42:50,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 346 events. 110/346 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1528 event pairs, 38 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 546. Up to 137 conditions per place. [2024-11-09 10:42:50,956 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-09 10:42:50,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 230 flow [2024-11-09 10:42:50,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:42:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:42:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2024-11-09 10:42:50,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5784615384615385 [2024-11-09 10:42:50,958 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 94 flow. Second operand 5 states and 188 transitions. [2024-11-09 10:42:50,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 230 flow [2024-11-09 10:42:50,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:42:50,962 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 131 flow [2024-11-09 10:42:50,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-11-09 10:42:50,963 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2024-11-09 10:42:50,963 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 131 flow [2024-11-09 10:42:50,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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:42:50,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:50,964 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:50,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:42:50,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:42:50,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:50,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1246641382, now seen corresponding path program 1 times [2024-11-09 10:42:50,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:50,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552483528] [2024-11-09 10:42:50,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:50,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:51,113 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:42:51,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:42:51,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552483528] [2024-11-09 10:42:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552483528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:51,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:42:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292989876] [2024-11-09 10:42:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:51,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:42:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:42:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:42:51,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:42:51,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-09 10:42:51,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:42:51,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:51,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-09 10:42:51,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:51,203 INFO L124 PetriNetUnfolderBase]: 60/237 cut-off events. [2024-11-09 10:42:51,203 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-09 10:42:51,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 237 events. 60/237 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 908 event pairs, 20 based on Foata normal form. 13/248 useless extension candidates. Maximal degree in co-relation 373. Up to 83 conditions per place. [2024-11-09 10:42:51,205 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 29 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2024-11-09 10:42:51,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 231 flow [2024-11-09 10:42:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:42:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:42:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2024-11-09 10:42:51,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5923076923076923 [2024-11-09 10:42:51,207 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 131 flow. Second operand 4 states and 154 transitions. [2024-11-09 10:42:51,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 231 flow [2024-11-09 10:42:51,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 224 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-09 10:42:51,210 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 152 flow [2024-11-09 10:42:51,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-11-09 10:42:51,211 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-11-09 10:42:51,212 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 152 flow [2024-11-09 10:42:51,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:42:51,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:51,213 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:51,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:42:51,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:42:51,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2107059513, now seen corresponding path program 1 times [2024-11-09 10:42:51,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:42:51,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460014215] [2024-11-09 10:42:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:42:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:42:51,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:42:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:42:51,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:42:51,275 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:42:51,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2024-11-09 10:42:51,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-09 10:42:51,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-09 10:42:51,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (17 of 21 remaining) [2024-11-09 10:42:51,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 21 remaining) [2024-11-09 10:42:51,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-09 10:42:51,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-09 10:42:51,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-09 10:42:51,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-09 10:42:51,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-09 10:42:51,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-09 10:42:51,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-09 10:42:51,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-09 10:42:51,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-09 10:42:51,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-09 10:42:51,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-09 10:42:51,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-09 10:42:51,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-09 10:42:51,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-09 10:42:51,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-09 10:42:51,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2024-11-09 10:42:51,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:42:51,284 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:51,329 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:42:51,329 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:42:51,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:42:51 BasicIcfg [2024-11-09 10:42:51,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:42:51,336 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:42:51,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:42:51,336 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:42:51,336 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:42:49" (3/4) ... [2024-11-09 10:42:51,338 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:42:51,339 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:42:51,342 INFO L158 Benchmark]: Toolchain (without parser) took 3352.08ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 91.9MB in the beginning and 93.5MB in the end (delta: -1.6MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2024-11-09 10:42:51,342 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory was 112.0MB in the beginning and 112.0MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:42:51,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.46ms. Allocated memory is still 146.8MB. Free memory was 91.5MB in the beginning and 68.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 10:42:51,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.16ms. Allocated memory is still 146.8MB. Free memory was 68.4MB in the beginning and 66.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:42:51,342 INFO L158 Benchmark]: Boogie Preprocessor took 78.74ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 66.3MB in the beginning and 171.8MB in the end (delta: -105.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-09 10:42:51,343 INFO L158 Benchmark]: RCFGBuilder took 663.02ms. Allocated memory is still 201.3MB. Free memory was 171.7MB in the beginning and 135.3MB in the end (delta: 36.4MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-11-09 10:42:51,343 INFO L158 Benchmark]: TraceAbstraction took 2104.83ms. Allocated memory is still 201.3MB. Free memory was 135.3MB in the beginning and 94.6MB in the end (delta: 40.7MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-09 10:42:51,343 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 201.3MB. Free memory was 94.6MB in the beginning and 93.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:42:51,344 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory was 112.0MB in the beginning and 112.0MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.46ms. Allocated memory is still 146.8MB. Free memory was 91.5MB in the beginning and 68.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.16ms. Allocated memory is still 146.8MB. Free memory was 68.4MB in the beginning and 66.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.74ms. Allocated memory was 146.8MB in the beginning and 201.3MB in the end (delta: 54.5MB). Free memory was 66.3MB in the beginning and 171.8MB in the end (delta: -105.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * RCFGBuilder took 663.02ms. Allocated memory is still 201.3MB. Free memory was 171.7MB in the beginning and 135.3MB in the end (delta: 36.4MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2104.83ms. Allocated memory is still 201.3MB. Free memory was 135.3MB in the beginning and 94.6MB in the end (delta: 40.7MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 201.3MB. Free memory was 94.6MB in the beginning and 93.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 690]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 690. Possible FailurePath: [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L707] 0 pthread_t id; [L708] 0 int i = 0; [L708] 0 int i = 0; [L709] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, (void *) &i) VAL [\old(arg)={6:0}, __global_lock={3:0}, i={6:0}, id=-1, mutex1={4:0}, mutex2={5:0}] [L700] 1 int *p = (int *) arg; VAL [\old(arg)={6:0}, __global_lock={3:0}, arg={6:0}, mutex1={4:0}, mutex2={5:0}, p={6:0}] [L702] EXPR 1 \read(*p) [L702] 1 (*p)++ VAL [\old(arg)={6:0}, __global_lock={3:0}, arg={6:0}, mutex1={4:0}, mutex2={5:0}, p={6:0}] [L702] 1 (*p)++ [L711] EXPR 0 \read(i) [L711] CALL 0 __VERIFIER_assert((i) == 0) [L691] COND TRUE 0 !(cond) [L691] CALL 0 reach_error() [L690] COND FALSE 0 !(0) VAL [\old(arg)={6:0}, __global_lock={3:0}, arg={6:0}, mutex1={4:0}, mutex2={5:0}, p={6:0}] [L690] 0 __assert_fail ("0", "racemacros.h", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={6:0}, __global_lock={3:0}, arg={6:0}, mutex1={4:0}, mutex2={5:0}, p={6:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 87 locations, 21 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 37 mSDtfsCounter, 431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 349 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:42:51,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4864acf28eb3fe42b4a237468061905eb474c41e1edb519c0790cee08cdc91bf --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:42:53,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:42:53,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:42:53,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:42:53,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:42:54,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:42:54,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:42:54,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:42:54,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:42:54,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:42:54,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:42:54,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:42:54,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:42:54,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:42:54,028 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:42:54,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:42:54,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:42:54,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:42:54,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:42:54,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:42:54,030 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:42:54,033 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:42:54,034 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:42:54,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:42:54,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:42:54,034 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:42:54,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:42:54,034 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:42:54,034 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:42:54,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:42:54,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:42:54,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:42:54,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:42:54,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:42:54,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:42:54,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:42:54,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:42:54,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:42:54,036 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:42:54,036 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:42:54,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:42:54,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:42:54,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:42:54,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:42:54,038 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 -> 4864acf28eb3fe42b4a237468061905eb474c41e1edb519c0790cee08cdc91bf [2024-11-09 10:42:54,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:42:54,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:42:54,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:42:54,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:42:54,383 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:42:54,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-09 10:42:55,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:42:56,094 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:42:56,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-09 10:42:56,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb55cd5eb/1d794790fb0444e5a52ab656d16a8492/FLAGb352fb12b [2024-11-09 10:42:56,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb55cd5eb/1d794790fb0444e5a52ab656d16a8492 [2024-11-09 10:42:56,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:42:56,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:42:56,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:42:56,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:42:56,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:42:56,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f292265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56, skipping insertion in model container [2024-11-09 10:42:56,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:42:56,536 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:42:56,543 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:42:56,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:42:56,574 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:42:56,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:42:56,685 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:42:56,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56 WrapperNode [2024-11-09 10:42:56,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:42:56,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:42:56,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:42:56,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:42:56,697 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:42:56" (1/1) ... [2024-11-09 10:42:56,719 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:42:56" (1/1) ... [2024-11-09 10:42:56,750 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2024-11-09 10:42:56,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:42:56,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:42:56,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:42:56,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:42:56,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,787 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 6, 5, 5, 5]. 26 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 5, 5, 5]. The 2 writes are split as follows [0, 2, 0, 0, 0]. [2024-11-09 10:42:56,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:42:56,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:42:56,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:42:56,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:42:56,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56" (1/1) ... [2024-11-09 10:42:56,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:42:56,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:42:56,835 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:42:56,838 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:42:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:42:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:42:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:42:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 10:42:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 10:42:56,879 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:42:56,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:42:56,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:42:56,880 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 10:42:56,880 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 10:42:56,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:42:56,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:42:56,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:42:56,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:42:56,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 10:42:56,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 10:42:56,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:42:56,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:42:56,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:42:56,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 10:42:56,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 10:42:56,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:42:56,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 10:42:56,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 10:42:56,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 10:42:56,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 10:42:56,882 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:42:56,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:42:56,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:42:56,884 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:42:57,039 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:42:57,041 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:42:57,386 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:42:57,386 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:42:57,624 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:42:57,625 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-09 10:42:57,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:42:57 BoogieIcfgContainer [2024-11-09 10:42:57,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:42:57,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:42:57,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:42:57,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:42:57,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:42:56" (1/3) ... [2024-11-09 10:42:57,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e92490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:42:57, skipping insertion in model container [2024-11-09 10:42:57,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:42:56" (2/3) ... [2024-11-09 10:42:57,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e92490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:42:57, skipping insertion in model container [2024-11-09 10:42:57,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:42:57" (3/3) ... [2024-11-09 10:42:57,636 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_45-escape_racing.i [2024-11-09 10:42:57,653 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:42:57,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-09 10:42:57,654 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:42:57,712 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 10:42:57,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 65 transitions, 137 flow [2024-11-09 10:42:57,805 INFO L124 PetriNetUnfolderBase]: 10/64 cut-off events. [2024-11-09 10:42:57,806 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:42:57,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 64 events. 10/64 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 58. Up to 3 conditions per place. [2024-11-09 10:42:57,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 65 transitions, 137 flow [2024-11-09 10:42:57,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 63 transitions, 132 flow [2024-11-09 10:42:57,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:42:57,838 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;@3daf3fa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:42:57,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-09 10:42:57,849 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:42:57,849 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-11-09 10:42:57,849 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:42:57,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:57,850 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:57,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:42:57,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:57,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1205167714, now seen corresponding path program 1 times [2024-11-09 10:42:57,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:42:57,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169939487] [2024-11-09 10:42:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:57,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:42:57,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:42:57,878 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:42:57,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:42:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:58,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:42:58,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:42:58,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:42:58,095 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:42:58,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:42:58,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:42:58,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169939487] [2024-11-09 10:42:58,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169939487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:58,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:58,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:42:58,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203501917] [2024-11-09 10:42:58,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:58,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:42:58,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:42:58,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:42:58,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:42:58,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-09 10:42:58,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:42:58,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:58,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-09 10:42:58,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:58,317 INFO L124 PetriNetUnfolderBase]: 96/385 cut-off events. [2024-11-09 10:42:58,317 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:42:58,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 385 events. 96/385 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1972 event pairs, 96 based on Foata normal form. 74/423 useless extension candidates. Maximal degree in co-relation 592. Up to 215 conditions per place. [2024-11-09 10:42:58,322 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-09 10:42:58,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 156 flow [2024-11-09 10:42:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:42:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:42:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-09 10:42:58,347 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6102564102564103 [2024-11-09 10:42:58,349 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 132 flow. Second operand 3 states and 119 transitions. [2024-11-09 10:42:58,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 156 flow [2024-11-09 10:42:58,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:42:58,355 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 108 flow [2024-11-09 10:42:58,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-11-09 10:42:58,361 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2024-11-09 10:42:58,362 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 108 flow [2024-11-09 10:42:58,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:42:58,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:58,362 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:58,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:42:58,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:42:58,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:42:58,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:58,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1205167713, now seen corresponding path program 1 times [2024-11-09 10:42:58,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:42:58,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068373680] [2024-11-09 10:42:58,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:58,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:42:58,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:42:58,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:42:58,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:42:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:58,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:42:58,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:42:58,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:42:58,715 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:42:58,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:42:58,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:42:58,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068373680] [2024-11-09 10:42:58,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068373680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:58,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:58,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:42:58,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713030191] [2024-11-09 10:42:58,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:58,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:42:58,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:42:58,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:42:58,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:42:58,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-09 10:42:58,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:42:58,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:58,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-09 10:42:58,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:58,869 INFO L124 PetriNetUnfolderBase]: 96/383 cut-off events. [2024-11-09 10:42:58,869 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:42:58,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 383 events. 96/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1967 event pairs, 96 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 595. Up to 215 conditions per place. [2024-11-09 10:42:58,875 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-09 10:42:58,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 154 flow [2024-11-09 10:42:58,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:42:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:42:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-09 10:42:58,879 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2024-11-09 10:42:58,880 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 108 flow. Second operand 3 states and 109 transitions. [2024-11-09 10:42:58,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 154 flow [2024-11-09 10:42:58,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:42:58,882 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 106 flow [2024-11-09 10:42:58,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-11-09 10:42:58,883 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-09 10:42:58,883 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 106 flow [2024-11-09 10:42:58,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:42:58,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:58,883 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:58,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 10:42:59,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:42:59,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:42:59,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:59,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1121733783, now seen corresponding path program 1 times [2024-11-09 10:42:59,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:42:59,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143428667] [2024-11-09 10:42:59,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:59,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:42:59,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:42:59,090 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:42:59,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:42:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:59,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:42:59,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:42:59,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:42:59,181 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:42:59,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:42:59,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:42:59,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143428667] [2024-11-09 10:42:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143428667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:59,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:59,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:42:59,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58269897] [2024-11-09 10:42:59,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:59,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:42:59,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:42:59,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:42:59,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:42:59,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-09 10:42:59,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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:42:59,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:59,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-09 10:42:59,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:59,342 INFO L124 PetriNetUnfolderBase]: 96/342 cut-off events. [2024-11-09 10:42:59,342 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:42:59,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 342 events. 96/342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1630 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 554. Up to 205 conditions per place. [2024-11-09 10:42:59,344 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-11-09 10:42:59,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 178 flow [2024-11-09 10:42:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:42:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:42:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-09 10:42:59,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-11-09 10:42:59,346 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 106 flow. Second operand 5 states and 156 transitions. [2024-11-09 10:42:59,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 178 flow [2024-11-09 10:42:59,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:42:59,348 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 102 flow [2024-11-09 10:42:59,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-11-09 10:42:59,349 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-09 10:42:59,349 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 102 flow [2024-11-09 10:42:59,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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:42:59,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:59,350 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:59,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:42:59,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:42:59,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:42:59,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:42:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1121733782, now seen corresponding path program 1 times [2024-11-09 10:42:59,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:42:59,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139433271] [2024-11-09 10:42:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:42:59,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:42:59,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:42:59,560 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:42:59,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:42:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:42:59,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:42:59,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:42:59,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:42:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:42:59,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:42:59,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:42:59,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139433271] [2024-11-09 10:42:59,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139433271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:42:59,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:42:59,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:42:59,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241607421] [2024-11-09 10:42:59,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:42:59,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:42:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:42:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:42:59,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:42:59,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-09 10:42:59,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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:42:59,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:42:59,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-09 10:42:59,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:42:59,842 INFO L124 PetriNetUnfolderBase]: 96/322 cut-off events. [2024-11-09 10:42:59,842 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 10:42:59,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 322 events. 96/322 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1419 event pairs, 66 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 380. Up to 205 conditions per place. [2024-11-09 10:42:59,844 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2024-11-09 10:42:59,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 174 flow [2024-11-09 10:42:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:42:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:42:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-11-09 10:42:59,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-11-09 10:42:59,845 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 102 flow. Second operand 6 states and 180 transitions. [2024-11-09 10:42:59,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 174 flow [2024-11-09 10:42:59,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:42:59,847 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 94 flow [2024-11-09 10:42:59,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-11-09 10:42:59,847 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2024-11-09 10:42:59,847 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 94 flow [2024-11-09 10:42:59,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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:42:59,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:42:59,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:42:59,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:43:00,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:43:00,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:43:00,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:43:00,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1519362597, now seen corresponding path program 1 times [2024-11-09 10:43:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:43:00,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75265938] [2024-11-09 10:43:00,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:43:00,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:43:00,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:43:00,055 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:43:00,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:43:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:43:00,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:43:00,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:43:00,224 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:43:00,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:43:00,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:43:00,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75265938] [2024-11-09 10:43:00,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75265938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:43:00,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:43:00,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:43:00,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66877924] [2024-11-09 10:43:00,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:43:00,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:43:00,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:43:00,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:43:00,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:43:00,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-09 10:43:00,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:43:00,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:43:00,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-09 10:43:00,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:43:00,391 INFO L124 PetriNetUnfolderBase]: 98/327 cut-off events. [2024-11-09 10:43:00,392 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 10:43:00,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 327 events. 98/327 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1457 event pairs, 38 based on Foata normal form. 13/335 useless extension candidates. Maximal degree in co-relation 450. Up to 145 conditions per place. [2024-11-09 10:43:00,394 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 38 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2024-11-09 10:43:00,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 224 flow [2024-11-09 10:43:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:43:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:43:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2024-11-09 10:43:00,396 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5876923076923077 [2024-11-09 10:43:00,396 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 94 flow. Second operand 5 states and 191 transitions. [2024-11-09 10:43:00,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 224 flow [2024-11-09 10:43:00,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 215 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:43:00,404 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 124 flow [2024-11-09 10:43:00,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-11-09 10:43:00,405 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-09 10:43:00,405 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 124 flow [2024-11-09 10:43:00,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:43:00,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:43:00,405 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:43:00,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:43:00,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:43:00,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:43:00,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:43:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1242200874, now seen corresponding path program 1 times [2024-11-09 10:43:00,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:43:00,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154676676] [2024-11-09 10:43:00,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:43:00,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:43:00,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:43:00,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:43:00,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:43:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:43:00,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:43:00,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:43:00,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 10:43:00,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 10:43:00,913 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:43:00,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:43:00,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:43:00,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154676676] [2024-11-09 10:43:00,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154676676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:43:00,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:43:00,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:43:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231538903] [2024-11-09 10:43:00,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:43:00,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:43:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:43:00,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:43:00,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:43:00,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-09 10:43:00,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:43:00,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:43:00,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-09 10:43:00,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:43:01,014 INFO L124 PetriNetUnfolderBase]: 56/237 cut-off events. [2024-11-09 10:43:01,014 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-09 10:43:01,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 237 events. 56/237 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 917 event pairs, 20 based on Foata normal form. 13/248 useless extension candidates. Maximal degree in co-relation 407. Up to 81 conditions per place. [2024-11-09 10:43:01,015 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 31 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-11-09 10:43:01,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 220 flow [2024-11-09 10:43:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:43:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:43:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2024-11-09 10:43:01,017 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-09 10:43:01,017 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 124 flow. Second operand 4 states and 156 transitions. [2024-11-09 10:43:01,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 220 flow [2024-11-09 10:43:01,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 218 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:43:01,018 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 146 flow [2024-11-09 10:43:01,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-11-09 10:43:01,019 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-09 10:43:01,019 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 146 flow [2024-11-09 10:43:01,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:43:01,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:43:01,020 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:43:01,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 10:43:01,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:43:01,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (and 18 more)] === [2024-11-09 10:43:01,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:43:01,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1337138261, now seen corresponding path program 1 times [2024-11-09 10:43:01,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:43:01,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289871783] [2024-11-09 10:43:01,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:43:01,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:43:01,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:43:01,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:43:01,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:43:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:43:01,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:43:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:43:01,382 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:43:01,382 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:43:01,387 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2024-11-09 10:43:01,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-09 10:43:01,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-09 10:43:01,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (17 of 21 remaining) [2024-11-09 10:43:01,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 21 remaining) [2024-11-09 10:43:01,393 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-09 10:43:01,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-09 10:43:01,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-09 10:43:01,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-09 10:43:01,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-09 10:43:01,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-09 10:43:01,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-09 10:43:01,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-09 10:43:01,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-09 10:43:01,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-09 10:43:01,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-09 10:43:01,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-09 10:43:01,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-09 10:43:01,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-09 10:43:01,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-09 10:43:01,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2024-11-09 10:43:01,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:43:01,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:43:01,601 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:43:01,626 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:43:01,626 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:43:01,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:43:01 BasicIcfg [2024-11-09 10:43:01,634 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:43:01,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:43:01,635 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:43:01,635 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:43:01,635 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:42:57" (3/4) ... [2024-11-09 10:43:01,636 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:43:01,637 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:43:01,638 INFO L158 Benchmark]: Toolchain (without parser) took 5502.35ms. Allocated memory was 81.8MB in the beginning and 142.6MB in the end (delta: 60.8MB). Free memory was 48.3MB in the beginning and 67.1MB in the end (delta: -18.8MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-11-09 10:43:01,638 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 52.4MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:43:01,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.59ms. Allocated memory is still 81.8MB. Free memory was 48.0MB in the beginning and 45.2MB in the end (delta: 2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 10:43:01,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.63ms. Allocated memory is still 81.8MB. Free memory was 45.2MB in the beginning and 43.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:43:01,639 INFO L158 Benchmark]: Boogie Preprocessor took 52.55ms. Allocated memory is still 81.8MB. Free memory was 43.0MB in the beginning and 40.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:43:01,639 INFO L158 Benchmark]: RCFGBuilder took 822.54ms. Allocated memory is still 81.8MB. Free memory was 40.1MB in the beginning and 39.6MB in the end (delta: 521.2kB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-09 10:43:01,639 INFO L158 Benchmark]: TraceAbstraction took 4005.75ms. Allocated memory was 81.8MB in the beginning and 142.6MB in the end (delta: 60.8MB). Free memory was 39.1MB in the beginning and 67.1MB in the end (delta: -28.0MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-11-09 10:43:01,639 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 142.6MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:43:01,641 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 52.4MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 544.59ms. Allocated memory is still 81.8MB. Free memory was 48.0MB in the beginning and 45.2MB in the end (delta: 2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.63ms. Allocated memory is still 81.8MB. Free memory was 45.2MB in the beginning and 43.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.55ms. Allocated memory is still 81.8MB. Free memory was 43.0MB in the beginning and 40.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 822.54ms. Allocated memory is still 81.8MB. Free memory was 40.1MB in the beginning and 39.6MB in the end (delta: 521.2kB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4005.75ms. Allocated memory was 81.8MB in the beginning and 142.6MB in the end (delta: 60.8MB). Free memory was 39.1MB in the beginning and 67.1MB in the end (delta: -28.0MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 142.6MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 690]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 690. Possible FailurePath: [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L698] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L707] 0 pthread_t id; [L708] 0 int i = 0; [L708] 0 int i = 0; [L709] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, (void *) &i) VAL [\old(arg)={7:0}, __global_lock={3:0}, i={7:0}, id=-1, mutex1={4:0}, mutex2={5:0}] [L700] 1 int *p = (int *) arg; VAL [\old(arg)={7:0}, __global_lock={3:0}, arg={7:0}, mutex1={4:0}, mutex2={5:0}, p={7:0}] [L702] EXPR 1 \read(*p) [L702] 1 (*p)++ VAL [\old(arg)={7:0}, __global_lock={3:0}, arg={7:0}, mutex1={4:0}, mutex2={5:0}, p={7:0}] [L702] 1 (*p)++ [L711] EXPR 0 \read(i) [L711] CALL 0 __VERIFIER_assert((i) == 0) [L691] COND TRUE 0 !(cond) [L691] CALL 0 reach_error() [L690] COND FALSE 0 !(0) VAL [\old(arg)={7:0}, __global_lock={3:0}, arg={7:0}, mutex1={4:0}, mutex2={5:0}, p={7:0}] [L690] 0 __assert_fail ("0", "racemacros.h", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={7:0}, __global_lock={3:0}, arg={7:0}, mutex1={4:0}, mutex2={5:0}, p={7:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 87 locations, 21 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 329 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 4 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 399 SizeOfPredicates, 15 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:43:01,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample