./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 3061b6dc 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:40:58,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:40:59,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:40:59,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:40:59,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:40:59,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:40:59,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:40:59,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:40:59,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:40:59,106 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:40:59,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:40:59,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:40:59,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:40:59,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:40:59,111 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:40:59,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:40:59,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:40:59,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:40:59,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:40:59,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:40:59,113 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:40:59,118 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:40:59,118 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:40:59,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:40:59,118 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:40:59,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:40:59,119 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:40:59,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:40:59,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:40:59,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:40:59,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:40:59,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:40:59,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:40:59,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:40:59,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:40:59,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:40:59,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:40:59,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:40:59,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:40:59,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:40:59,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:40:59,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:40:59,125 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-19 09:40:59,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:40:59,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:40:59,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:40:59,392 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:40:59,393 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:40:59,396 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-19 09:41:00,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:41:01,069 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:41:01,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-19 09:41:01,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b15321de/c4c1b2795d9943ab928dc625f9fd90a2/FLAG4c292d29a [2024-11-19 09:41:01,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b15321de/c4c1b2795d9943ab928dc625f9fd90a2 [2024-11-19 09:41:01,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:41:01,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:41:01,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:41:01,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:41:01,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:41:01,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f2321f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01, skipping insertion in model container [2024-11-19 09:41:01,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:41:01,497 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-19 09:41:01,506 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-19 09:41:01,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:41:01,538 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:41:01,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:41:01,653 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:41:01,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01 WrapperNode [2024-11-19 09:41:01,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:41:01,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:41:01,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:41:01,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:41:01,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,735 INFO L138 Inliner]: procedures = 171, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-11-19 09:41:01,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:41:01,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:41:01,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:41:01,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:41:01,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,780 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 5, 5, 5, 6]. 26 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 5, 5, 1]. The 2 writes are split as follows [0, 0, 0, 0, 2]. [2024-11-19 09:41:01,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:41:01,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:41:01,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:41:01,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:41:01,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (1/1) ... [2024-11-19 09:41:01,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:41:01,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:41:01,851 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-19 09:41:01,858 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-19 09:41:01,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:41:01,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:41:01,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:41:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 09:41:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 09:41:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:41:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:41:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:41:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 09:41:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 09:41:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:41:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:41:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:41:01,908 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 09:41:01,908 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 09:41:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:41:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:41:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:41:01,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:41:01,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 09:41:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 09:41:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:41:01,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:41:01,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:41:01,913 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:41:02,082 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:41:02,085 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:41:02,364 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:41:02,366 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:41:02,528 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:41:02,528 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-19 09:41:02,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:41:02 BoogieIcfgContainer [2024-11-19 09:41:02,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:41:02,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:41:02,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:41:02,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:41:02,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:41:01" (1/3) ... [2024-11-19 09:41:02,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518dcd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:41:02, skipping insertion in model container [2024-11-19 09:41:02,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:01" (2/3) ... [2024-11-19 09:41:02,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518dcd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:41:02, skipping insertion in model container [2024-11-19 09:41:02,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:41:02" (3/3) ... [2024-11-19 09:41:02,538 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_45-escape_racing.i [2024-11-19 09:41:02,556 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:41:02,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-19 09:41:02,556 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:41:02,604 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 09:41:02,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 65 transitions, 137 flow [2024-11-19 09:41:02,684 INFO L124 PetriNetUnfolderBase]: 10/64 cut-off events. [2024-11-19 09:41:02,685 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:41:02,689 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-19 09:41:02,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 65 transitions, 137 flow [2024-11-19 09:41:02,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 63 transitions, 132 flow [2024-11-19 09:41:02,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:41:02,715 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;@177735e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:41:02,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-19 09:41:02,729 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:41:02,729 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-11-19 09:41:02,730 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:41:02,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:02,731 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:02,731 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-19 09:41:02,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:02,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2064971934, now seen corresponding path program 1 times [2024-11-19 09:41:02,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:41:02,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139032408] [2024-11-19 09:41:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:41:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:03,070 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-19 09:41:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:41:03,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139032408] [2024-11-19 09:41:03,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139032408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:03,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:03,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:41:03,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229863929] [2024-11-19 09:41:03,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:03,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:41:03,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:41:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:41:03,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:41:03,210 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-19 09:41:03,213 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-19 09:41:03,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:03,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-19 09:41:03,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:03,332 INFO L124 PetriNetUnfolderBase]: 96/385 cut-off events. [2024-11-19 09:41:03,332 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:41:03,334 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-19 09:41:03,338 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-19 09:41:03,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 156 flow [2024-11-19 09:41:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:41:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:41:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-19 09:41:03,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6102564102564103 [2024-11-19 09:41:03,352 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 132 flow. Second operand 3 states and 119 transitions. [2024-11-19 09:41:03,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 156 flow [2024-11-19 09:41:03,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:41:03,357 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 108 flow [2024-11-19 09:41:03,359 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-19 09:41:03,363 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2024-11-19 09:41:03,363 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 108 flow [2024-11-19 09:41:03,363 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-19 09:41:03,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:03,364 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:03,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:41:03,364 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-19 09:41:03,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2064971935, now seen corresponding path program 1 times [2024-11-19 09:41:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:41:03,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539563609] [2024-11-19 09:41:03,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:41:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:03,495 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-19 09:41:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:41:03,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539563609] [2024-11-19 09:41:03,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539563609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:03,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:03,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:41:03,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345297466] [2024-11-19 09:41:03,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:03,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:41:03,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:41:03,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:41:03,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:41:03,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-19 09:41:03,513 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-19 09:41:03,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:03,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-19 09:41:03,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:03,590 INFO L124 PetriNetUnfolderBase]: 96/383 cut-off events. [2024-11-19 09:41:03,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:41:03,592 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-19 09:41:03,594 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-19 09:41:03,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 154 flow [2024-11-19 09:41:03,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:41:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:41:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-19 09:41:03,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2024-11-19 09:41:03,597 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 108 flow. Second operand 3 states and 109 transitions. [2024-11-19 09:41:03,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 154 flow [2024-11-19 09:41:03,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:41:03,599 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 106 flow [2024-11-19 09:41:03,599 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-19 09:41:03,600 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-19 09:41:03,600 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 106 flow [2024-11-19 09:41:03,600 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-19 09:41:03,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:03,601 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:03,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:41:03,602 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-19 09:41:03,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1468347495, now seen corresponding path program 1 times [2024-11-19 09:41:03,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:41:03,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636574811] [2024-11-19 09:41:03,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:03,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:41:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:03,707 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-19 09:41:03,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:41:03,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636574811] [2024-11-19 09:41:03,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636574811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:03,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:03,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:41:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65200144] [2024-11-19 09:41:03,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:03,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:41:03,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:41:03,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:41:03,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:41:03,749 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-19 09:41:03,749 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-19 09:41:03,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:03,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-19 09:41:03,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:03,869 INFO L124 PetriNetUnfolderBase]: 96/342 cut-off events. [2024-11-19 09:41:03,870 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:41:03,871 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-19 09:41:03,873 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-11-19 09:41:03,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 178 flow [2024-11-19 09:41:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:41:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:41:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-19 09:41:03,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-11-19 09:41:03,876 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 106 flow. Second operand 5 states and 156 transitions. [2024-11-19 09:41:03,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 178 flow [2024-11-19 09:41:03,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:41:03,878 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 102 flow [2024-11-19 09:41:03,878 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-19 09:41:03,879 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-19 09:41:03,879 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 102 flow [2024-11-19 09:41:03,879 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-19 09:41:03,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:03,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:03,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:41:03,880 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-19 09:41:03,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:03,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1468347496, now seen corresponding path program 1 times [2024-11-19 09:41:03,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:41:03,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579504493] [2024-11-19 09:41:03,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:03,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:41:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:04,026 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-19 09:41:04,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:41:04,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579504493] [2024-11-19 09:41:04,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579504493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:04,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:04,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:41:04,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201539990] [2024-11-19 09:41:04,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:04,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:41:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:41:04,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:41:04,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:41:04,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-19 09:41:04,088 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-19 09:41:04,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:04,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-19 09:41:04,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:04,301 INFO L124 PetriNetUnfolderBase]: 96/306 cut-off events. [2024-11-19 09:41:04,303 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-19 09:41:04,304 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-19 09:41:04,306 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2024-11-19 09:41:04,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 174 flow [2024-11-19 09:41:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:41:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:41:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-11-19 09:41:04,311 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-11-19 09:41:04,311 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 102 flow. Second operand 6 states and 180 transitions. [2024-11-19 09:41:04,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 174 flow [2024-11-19 09:41:04,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:41:04,314 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 94 flow [2024-11-19 09:41:04,314 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-19 09:41:04,315 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2024-11-19 09:41:04,315 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 94 flow [2024-11-19 09:41:04,316 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-19 09:41:04,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:04,316 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:04,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:41:04,317 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-19 09:41:04,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash 762681113, now seen corresponding path program 1 times [2024-11-19 09:41:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:41:04,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680312365] [2024-11-19 09:41:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:04,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:41:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:04,401 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-19 09:41:04,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:41:04,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680312365] [2024-11-19 09:41:04,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680312365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:04,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:04,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:41:04,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184394554] [2024-11-19 09:41:04,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:04,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:41:04,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:41:04,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:41:04,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:41:04,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-19 09:41:04,412 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-19 09:41:04,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:04,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-19 09:41:04,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:04,534 INFO L124 PetriNetUnfolderBase]: 110/346 cut-off events. [2024-11-19 09:41:04,534 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-19 09:41:04,535 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-19 09:41:04,536 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-19 09:41:04,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 230 flow [2024-11-19 09:41:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:41:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:41:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2024-11-19 09:41:04,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5784615384615385 [2024-11-19 09:41:04,538 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 94 flow. Second operand 5 states and 188 transitions. [2024-11-19 09:41:04,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 230 flow [2024-11-19 09:41:04,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:41:04,542 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 131 flow [2024-11-19 09:41:04,543 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-19 09:41:04,543 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2024-11-19 09:41:04,544 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 131 flow [2024-11-19 09:41:04,545 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-19 09:41:04,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:04,545 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-19 09:41:04,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:41:04,546 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-19 09:41:04,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:04,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1246641382, now seen corresponding path program 1 times [2024-11-19 09:41:04,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:41:04,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781413963] [2024-11-19 09:41:04,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:04,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:41:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:04,682 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-19 09:41:04,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:41:04,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781413963] [2024-11-19 09:41:04,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781413963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:04,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:04,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:41:04,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90349188] [2024-11-19 09:41:04,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:04,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:41:04,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:41:04,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:41:04,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:41:04,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-19 09:41:04,686 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-19 09:41:04,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:04,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-19 09:41:04,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:04,769 INFO L124 PetriNetUnfolderBase]: 60/237 cut-off events. [2024-11-19 09:41:04,770 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-19 09:41:04,770 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-19 09:41:04,771 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 29 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2024-11-19 09:41:04,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 231 flow [2024-11-19 09:41:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:41:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:41:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2024-11-19 09:41:04,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5923076923076923 [2024-11-19 09:41:04,773 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 131 flow. Second operand 4 states and 154 transitions. [2024-11-19 09:41:04,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 231 flow [2024-11-19 09:41:04,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 224 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-19 09:41:04,776 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 152 flow [2024-11-19 09:41:04,776 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-19 09:41:04,777 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-11-19 09:41:04,777 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 152 flow [2024-11-19 09:41:04,777 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-19 09:41:04,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:04,777 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-19 09:41:04,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:41:04,777 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-19 09:41:04,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:04,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2107059513, now seen corresponding path program 1 times [2024-11-19 09:41:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:41:04,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823514396] [2024-11-19 09:41:04,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:04,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:41:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:41:04,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:41:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:41:04,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:41:04,839 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:41:04,840 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2024-11-19 09:41:04,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-19 09:41:04,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-19 09:41:04,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (17 of 21 remaining) [2024-11-19 09:41:04,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 21 remaining) [2024-11-19 09:41:04,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-19 09:41:04,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-19 09:41:04,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-19 09:41:04,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-19 09:41:04,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-19 09:41:04,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-19 09:41:04,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-19 09:41:04,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-19 09:41:04,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-19 09:41:04,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-19 09:41:04,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-19 09:41:04,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-19 09:41:04,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-19 09:41:04,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-19 09:41:04,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-19 09:41:04,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2024-11-19 09:41:04,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:41:04,847 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:04,894 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:41:04,894 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:41:04,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:41:04 BasicIcfg [2024-11-19 09:41:04,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:41:04,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:41:04,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:41:04,901 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:41:04,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:41:02" (3/4) ... [2024-11-19 09:41:04,903 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:41:04,904 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:41:04,907 INFO L158 Benchmark]: Toolchain (without parser) took 3800.57ms. Allocated memory was 146.8MB in the beginning and 207.6MB in the end (delta: 60.8MB). Free memory was 75.8MB in the beginning and 64.4MB in the end (delta: 11.3MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2024-11-19 09:41:04,907 INFO L158 Benchmark]: CDTParser took 1.86ms. Allocated memory is still 146.8MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:41:04,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.75ms. Allocated memory is still 146.8MB. Free memory was 75.6MB in the beginning and 115.3MB in the end (delta: -39.7MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-11-19 09:41:04,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.44ms. Allocated memory was 146.8MB in the beginning and 207.6MB in the end (delta: 60.8MB). Free memory was 115.2MB in the beginning and 178.0MB in the end (delta: -62.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-19 09:41:04,909 INFO L158 Benchmark]: Boogie Preprocessor took 73.37ms. Allocated memory is still 207.6MB. Free memory was 176.9MB in the beginning and 174.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:41:04,909 INFO L158 Benchmark]: RCFGBuilder took 717.27ms. Allocated memory is still 207.6MB. Free memory was 174.8MB in the beginning and 136.0MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-19 09:41:04,909 INFO L158 Benchmark]: TraceAbstraction took 2369.76ms. Allocated memory is still 207.6MB. Free memory was 136.0MB in the beginning and 64.4MB in the end (delta: 71.6MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2024-11-19 09:41:04,909 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 207.6MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:41:04,911 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.86ms. Allocated memory is still 146.8MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.75ms. Allocated memory is still 146.8MB. Free memory was 75.6MB in the beginning and 115.3MB in the end (delta: -39.7MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.44ms. Allocated memory was 146.8MB in the beginning and 207.6MB in the end (delta: 60.8MB). Free memory was 115.2MB in the beginning and 178.0MB in the end (delta: -62.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.37ms. Allocated memory is still 207.6MB. Free memory was 176.9MB in the beginning and 174.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 717.27ms. Allocated memory is still 207.6MB. Free memory was 174.8MB in the beginning and 136.0MB in the end (delta: 38.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2369.76ms. Allocated memory is still 207.6MB. Free memory was 136.0MB in the beginning and 64.4MB in the end (delta: 71.6MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 207.6MB. Free memory is still 64.4MB. 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)={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: 2.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.4s 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.2s 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.7s 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-19 09:41:04,944 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:41:07,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:41:07,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:41:07,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:41:07,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:41:07,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:41:07,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:41:07,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:41:07,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:41:07,354 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:41:07,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:41:07,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:41:07,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:41:07,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:41:07,356 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:41:07,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:41:07,358 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:41:07,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:41:07,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:41:07,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:41:07,360 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:41:07,364 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:41:07,364 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:41:07,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:41:07,365 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:41:07,365 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:41:07,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:41:07,366 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:41:07,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:41:07,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:41:07,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:41:07,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:41:07,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:41:07,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:41:07,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:41:07,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:41:07,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:41:07,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:41:07,369 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:41:07,370 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:41:07,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:41:07,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:41:07,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:41:07,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:41:07,371 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-19 09:41:07,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:41:07,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:41:07,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:41:07,779 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:41:07,780 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:41:07,781 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-19 09:41:09,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:41:09,596 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:41:09,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-19 09:41:09,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a74eb0236/2d5c56da7fe24bbba9bd369f81f86aec/FLAG1407d5f03 [2024-11-19 09:41:09,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a74eb0236/2d5c56da7fe24bbba9bd369f81f86aec [2024-11-19 09:41:09,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:41:09,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:41:09,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:41:09,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:41:09,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:41:09,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:41:09" (1/1) ... [2024-11-19 09:41:09,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53443a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:09, skipping insertion in model container [2024-11-19 09:41:09,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:41:09" (1/1) ... [2024-11-19 09:41:09,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:41:10,075 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-19 09:41:10,086 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-19 09:41:10,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:41:10,117 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:41:10,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:41:10,198 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:41:10,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10 WrapperNode [2024-11-19 09:41:10,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:41:10,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:41:10,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:41:10,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:41:10,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,251 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2024-11-19 09:41:10,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:41:10,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:41:10,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:41:10,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:41:10,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,315 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 5, 5, 5, 6]. 26 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 5, 5, 1]. The 2 writes are split as follows [0, 0, 0, 0, 2]. [2024-11-19 09:41:10,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:41:10,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:41:10,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:41:10,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:41:10,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (1/1) ... [2024-11-19 09:41:10,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:41:10,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:41:10,391 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-19 09:41:10,393 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-19 09:41:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:41:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:41:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:41:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 09:41:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 09:41:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:41:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:41:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:41:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 09:41:10,428 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 09:41:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:41:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:41:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:41:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:41:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 09:41:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 09:41:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:41:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:41:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:41:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 09:41:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 09:41:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 09:41:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 09:41:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 09:41:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 09:41:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 09:41:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:41:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:41:10,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:41:10,432 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:41:10,623 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:41:10,625 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:41:10,963 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:41:10,963 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:41:11,231 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:41:11,231 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-19 09:41:11,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:41:11 BoogieIcfgContainer [2024-11-19 09:41:11,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:41:11,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:41:11,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:41:11,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:41:11,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:41:09" (1/3) ... [2024-11-19 09:41:11,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a6fb5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:41:11, skipping insertion in model container [2024-11-19 09:41:11,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:41:10" (2/3) ... [2024-11-19 09:41:11,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a6fb5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:41:11, skipping insertion in model container [2024-11-19 09:41:11,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:41:11" (3/3) ... [2024-11-19 09:41:11,241 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_45-escape_racing.i [2024-11-19 09:41:11,258 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:41:11,258 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-19 09:41:11,258 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:41:11,319 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 09:41:11,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 65 transitions, 137 flow [2024-11-19 09:41:11,398 INFO L124 PetriNetUnfolderBase]: 10/64 cut-off events. [2024-11-19 09:41:11,400 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:41:11,403 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-19 09:41:11,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 65 transitions, 137 flow [2024-11-19 09:41:11,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 63 transitions, 132 flow [2024-11-19 09:41:11,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:41:11,430 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;@b41717, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:41:11,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-19 09:41:11,442 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:41:11,443 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-11-19 09:41:11,443 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:41:11,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:11,444 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:11,445 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-19 09:41:11,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1205167714, now seen corresponding path program 1 times [2024-11-19 09:41:11,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:41:11,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584442918] [2024-11-19 09:41:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:11,465 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-19 09:41:11,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:41:11,469 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-19 09:41:11,470 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-19 09:41:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:11,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:41:11,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:41:11,672 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-19 09:41:11,711 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-19 09:41:11,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:41:11,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:41:11,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584442918] [2024-11-19 09:41:11,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584442918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:11,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:11,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:41:11,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498523099] [2024-11-19 09:41:11,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:11,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:41:11,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:41:11,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:41:11,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:41:11,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-19 09:41:11,785 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-19 09:41:11,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:11,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-19 09:41:11,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:11,933 INFO L124 PetriNetUnfolderBase]: 96/385 cut-off events. [2024-11-19 09:41:11,934 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:41:11,936 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-19 09:41:11,939 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-19 09:41:11,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 156 flow [2024-11-19 09:41:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:41:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:41:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-19 09:41:11,960 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6102564102564103 [2024-11-19 09:41:11,968 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 132 flow. Second operand 3 states and 119 transitions. [2024-11-19 09:41:11,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 156 flow [2024-11-19 09:41:11,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:41:11,979 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 108 flow [2024-11-19 09:41:11,984 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-19 09:41:11,993 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2024-11-19 09:41:11,994 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 108 flow [2024-11-19 09:41:11,994 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-19 09:41:11,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:11,994 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:12,003 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-19 09:41:12,195 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-19 09:41:12,196 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-19 09:41:12,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1205167713, now seen corresponding path program 1 times [2024-11-19 09:41:12,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:41:12,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003210277] [2024-11-19 09:41:12,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:12,199 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-19 09:41:12,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:41:12,201 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-19 09:41:12,205 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-19 09:41:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:12,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:41:12,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:41:12,298 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-19 09:41:12,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-19 09:41:12,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:41:12,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:41:12,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003210277] [2024-11-19 09:41:12,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003210277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:12,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:41:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656522399] [2024-11-19 09:41:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:12,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:41:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:41:12,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:41:12,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:41:12,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-19 09:41:12,397 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-19 09:41:12,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:12,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-19 09:41:12,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:12,523 INFO L124 PetriNetUnfolderBase]: 96/383 cut-off events. [2024-11-19 09:41:12,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:41:12,524 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-19 09:41:12,527 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-19 09:41:12,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 154 flow [2024-11-19 09:41:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:41:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:41:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-19 09:41:12,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2024-11-19 09:41:12,530 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 108 flow. Second operand 3 states and 109 transitions. [2024-11-19 09:41:12,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 154 flow [2024-11-19 09:41:12,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:41:12,532 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 106 flow [2024-11-19 09:41:12,533 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-19 09:41:12,533 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-19 09:41:12,534 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 106 flow [2024-11-19 09:41:12,534 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-19 09:41:12,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:12,534 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:12,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:41:12,735 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-19 09:41:12,736 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-19 09:41:12,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1121733783, now seen corresponding path program 1 times [2024-11-19 09:41:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:41:12,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976911825] [2024-11-19 09:41:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:12,738 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-19 09:41:12,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:41:12,741 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-19 09:41:12,743 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-19 09:41:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:12,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:41:12,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:41:12,824 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-19 09:41:12,872 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-19 09:41:12,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:41:12,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:41:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976911825] [2024-11-19 09:41:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976911825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:12,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:12,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:41:12,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046121481] [2024-11-19 09:41:12,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:12,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:41:12,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:41:12,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:41:12,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:41:12,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-19 09:41:12,945 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-19 09:41:12,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:12,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-19 09:41:12,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:13,114 INFO L124 PetriNetUnfolderBase]: 96/342 cut-off events. [2024-11-19 09:41:13,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:41:13,117 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-19 09:41:13,121 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-11-19 09:41:13,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 178 flow [2024-11-19 09:41:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:41:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:41:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-19 09:41:13,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-11-19 09:41:13,125 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 106 flow. Second operand 5 states and 156 transitions. [2024-11-19 09:41:13,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 178 flow [2024-11-19 09:41:13,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:41:13,128 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 102 flow [2024-11-19 09:41:13,129 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-19 09:41:13,130 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-19 09:41:13,131 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 102 flow [2024-11-19 09:41:13,131 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-19 09:41:13,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:13,132 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:13,139 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-19 09:41:13,335 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-19 09:41:13,336 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-19 09:41:13,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1121733782, now seen corresponding path program 1 times [2024-11-19 09:41:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:41:13,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607243008] [2024-11-19 09:41:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:13,338 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-19 09:41:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:41:13,341 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-19 09:41:13,342 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-19 09:41:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:13,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:41:13,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:41:13,429 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-19 09:41:13,528 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-19 09:41:13,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:41:13,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:41:13,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607243008] [2024-11-19 09:41:13,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607243008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:13,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:13,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:41:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162897450] [2024-11-19 09:41:13,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:13,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:41:13,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:41:13,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:41:13,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:41:13,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-19 09:41:13,574 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-19 09:41:13,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:13,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-19 09:41:13,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:13,738 INFO L124 PetriNetUnfolderBase]: 96/322 cut-off events. [2024-11-19 09:41:13,739 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-19 09:41:13,740 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-19 09:41:13,742 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2024-11-19 09:41:13,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 174 flow [2024-11-19 09:41:13,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:41:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:41:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-11-19 09:41:13,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-11-19 09:41:13,745 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 102 flow. Second operand 6 states and 180 transitions. [2024-11-19 09:41:13,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 174 flow [2024-11-19 09:41:13,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:41:13,749 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 94 flow [2024-11-19 09:41:13,749 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-19 09:41:13,750 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2024-11-19 09:41:13,750 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 94 flow [2024-11-19 09:41:13,751 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-19 09:41:13,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:13,751 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:13,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 09:41:13,951 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-19 09:41:13,952 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-19 09:41:13,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:13,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1519362597, now seen corresponding path program 1 times [2024-11-19 09:41:13,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:41:13,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359359478] [2024-11-19 09:41:13,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:13,953 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-19 09:41:13,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:41:13,957 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-19 09:41:13,958 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-19 09:41:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:14,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:41:14,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:41:14,068 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-19 09:41:14,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:41:14,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:41:14,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359359478] [2024-11-19 09:41:14,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359359478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:14,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:14,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:41:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403690861] [2024-11-19 09:41:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:14,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:41:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:41:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:41:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:41:14,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-19 09:41:14,083 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-19 09:41:14,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:14,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-19 09:41:14,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:14,247 INFO L124 PetriNetUnfolderBase]: 98/327 cut-off events. [2024-11-19 09:41:14,248 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-19 09:41:14,248 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-19 09:41:14,250 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 38 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2024-11-19 09:41:14,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 224 flow [2024-11-19 09:41:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:41:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:41:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2024-11-19 09:41:14,252 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5876923076923077 [2024-11-19 09:41:14,252 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 94 flow. Second operand 5 states and 191 transitions. [2024-11-19 09:41:14,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 224 flow [2024-11-19 09:41:14,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 215 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:41:14,256 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 124 flow [2024-11-19 09:41:14,256 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-19 09:41:14,257 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-19 09:41:14,257 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 124 flow [2024-11-19 09:41:14,258 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-19 09:41:14,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:14,258 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-19 09:41:14,262 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-19 09:41:14,459 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-19 09:41:14,460 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-19 09:41:14,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1242200874, now seen corresponding path program 1 times [2024-11-19 09:41:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:41:14,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241680298] [2024-11-19 09:41:14,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:14,461 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-19 09:41:14,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:41:14,465 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-19 09:41:14,467 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-19 09:41:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:41:14,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:41:14,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:41:14,601 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-19 09:41:14,627 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-19 09:41:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:41:14,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:41:14,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:41:14,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241680298] [2024-11-19 09:41:14,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241680298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:41:14,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:41:14,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:41:14,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562565348] [2024-11-19 09:41:14,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:41:14,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:41:14,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:41:14,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:41:14,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:41:14,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-19 09:41:14,671 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-19 09:41:14,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:41:14,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-19 09:41:14,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:41:14,806 INFO L124 PetriNetUnfolderBase]: 56/237 cut-off events. [2024-11-19 09:41:14,806 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-19 09:41:14,807 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-19 09:41:14,808 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 31 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-11-19 09:41:14,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 220 flow [2024-11-19 09:41:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:41:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:41:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2024-11-19 09:41:14,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-19 09:41:14,810 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 124 flow. Second operand 4 states and 156 transitions. [2024-11-19 09:41:14,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 220 flow [2024-11-19 09:41:14,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 218 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 09:41:14,812 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 146 flow [2024-11-19 09:41:14,812 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-19 09:41:14,813 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-19 09:41:14,813 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 146 flow [2024-11-19 09:41:14,813 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-19 09:41:14,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:41:14,813 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-19 09:41:14,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:41:15,017 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-19 09:41:15,018 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-19 09:41:15,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:41:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1337138261, now seen corresponding path program 1 times [2024-11-19 09:41:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:41:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681719704] [2024-11-19 09:41:15,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:41:15,019 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-19 09:41:15,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:41:15,020 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-19 09:41:15,021 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-19 09:41:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:41:15,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:41:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:41:15,168 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:41:15,169 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:41:15,170 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2024-11-19 09:41:15,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-19 09:41:15,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-19 09:41:15,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (17 of 21 remaining) [2024-11-19 09:41:15,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 21 remaining) [2024-11-19 09:41:15,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-19 09:41:15,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-19 09:41:15,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-19 09:41:15,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-19 09:41:15,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-19 09:41:15,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-19 09:41:15,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-19 09:41:15,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-19 09:41:15,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-19 09:41:15,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-19 09:41:15,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-19 09:41:15,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-19 09:41:15,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-19 09:41:15,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-19 09:41:15,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-19 09:41:15,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2024-11-19 09:41:15,187 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-19 09:41:15,379 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-19 09:41:15,380 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:41:15,425 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:41:15,426 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:41:15,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:41:15 BasicIcfg [2024-11-19 09:41:15,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:41:15,431 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:41:15,431 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:41:15,431 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:41:15,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:41:11" (3/4) ... [2024-11-19 09:41:15,433 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:41:15,434 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:41:15,435 INFO L158 Benchmark]: Toolchain (without parser) took 5793.75ms. Allocated memory was 73.4MB in the beginning and 113.2MB in the end (delta: 39.8MB). Free memory was 36.9MB in the beginning and 58.1MB in the end (delta: -21.2MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-19 09:41:15,438 INFO L158 Benchmark]: CDTParser took 1.41ms. Allocated memory is still 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:41:15,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.57ms. Allocated memory is still 73.4MB. Free memory was 36.6MB in the beginning and 31.8MB in the end (delta: 4.9MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-11-19 09:41:15,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.76ms. Allocated memory is still 73.4MB. Free memory was 31.8MB in the beginning and 29.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:41:15,439 INFO L158 Benchmark]: Boogie Preprocessor took 102.89ms. Allocated memory is still 73.4MB. Free memory was 29.8MB in the beginning and 50.3MB in the end (delta: -20.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:41:15,439 INFO L158 Benchmark]: RCFGBuilder took 876.16ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 50.3MB in the beginning and 55.5MB in the end (delta: -5.2MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-19 09:41:15,440 INFO L158 Benchmark]: TraceAbstraction took 4196.22ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 54.5MB in the beginning and 58.1MB in the end (delta: -3.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-19 09:41:15,440 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 113.2MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:41:15,442 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41ms. Allocated memory is still 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.57ms. Allocated memory is still 73.4MB. Free memory was 36.6MB in the beginning and 31.8MB in the end (delta: 4.9MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.76ms. Allocated memory is still 73.4MB. Free memory was 31.8MB in the beginning and 29.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.89ms. Allocated memory is still 73.4MB. Free memory was 29.8MB in the beginning and 50.3MB in the end (delta: -20.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 876.16ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 50.3MB in the beginning and 55.5MB in the end (delta: -5.2MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4196.22ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 54.5MB in the beginning and 58.1MB in the end (delta: -3.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 113.2MB. Free memory is still 58.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: 4.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 329 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.6s 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.2s 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.2s SatisfiabilityAnalysisTime, 0.5s 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-19 09:41:15,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample