./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/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 fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.dd.update-z3-fca748b-m [2024-11-20 17:36:04,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:36:04,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:36:04,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:36:04,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:36:04,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:36:04,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:36:04,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:36:04,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:36:04,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:36:04,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:36:04,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:36:04,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:36:04,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:36:04,691 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:36:04,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:36:04,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:36:04,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:36:04,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:36:04,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:36:04,693 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:36:04,694 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:36:04,694 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:36:04,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:36:04,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:36:04,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:36:04,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:36:04,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:36:04,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:36:04,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:36:04,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:36:04,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:36:04,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:36:04,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:36:04,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:36:04,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:36:04,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:36:04,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:36:04,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:36:04,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:36:04,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:36:04,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:36:04,699 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-20 17:36:04,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:36:05,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:36:05,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:36:05,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:36:05,007 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:36:05,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-20 17:36:06,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:36:06,779 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:36:06,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-20 17:36:06,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/179fec611/78e5efcd3fe84421b4fff0eced543477/FLAGbe1caa6c3 [2024-11-20 17:36:06,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/179fec611/78e5efcd3fe84421b4fff0eced543477 [2024-11-20 17:36:06,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:36:06,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:36:06,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:36:06,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:36:06,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:36:06,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:36:06" (1/1) ... [2024-11-20 17:36:06,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260be152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:06, skipping insertion in model container [2024-11-20 17:36:06,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:36:06" (1/1) ... [2024-11-20 17:36:06,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:36:07,285 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-20 17:36:07,296 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-20 17:36:07,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:36:07,323 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:36:07,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:36:07,428 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:36:07,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07 WrapperNode [2024-11-20 17:36:07,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:36:07,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:36:07,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:36:07,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:36:07,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,488 INFO L138 Inliner]: procedures = 171, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-11-20 17:36:07,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:36:07,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:36:07,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:36:07,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:36:07,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,528 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-20 17:36:07,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:36:07,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:36:07,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:36:07,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:36:07,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (1/1) ... [2024-11-20 17:36:07,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:36:07,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:36:07,601 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-20 17:36:07,604 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-20 17:36:07,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 17:36:07,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 17:36:07,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 17:36:07,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 17:36:07,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 17:36:07,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 17:36:07,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 17:36:07,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 17:36:07,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 17:36:07,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 17:36:07,661 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 17:36:07,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:36:07,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 17:36:07,661 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-20 17:36:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-20 17:36:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 17:36:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:36:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 17:36:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 17:36:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 17:36:07,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 17:36:07,663 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 17:36:07,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:36:07,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:36:07,665 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:36:07,804 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:36:07,806 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:36:08,037 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:36:08,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:36:08,214 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:36:08,214 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-20 17:36:08,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:36:08 BoogieIcfgContainer [2024-11-20 17:36:08,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:36:08,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:36:08,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:36:08,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:36:08,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:36:06" (1/3) ... [2024-11-20 17:36:08,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a138e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:36:08, skipping insertion in model container [2024-11-20 17:36:08,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:07" (2/3) ... [2024-11-20 17:36:08,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a138e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:36:08, skipping insertion in model container [2024-11-20 17:36:08,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:36:08" (3/3) ... [2024-11-20 17:36:08,225 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_45-escape_racing.i [2024-11-20 17:36:08,244 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:36:08,244 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-20 17:36:08,244 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:36:08,301 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-20 17:36:08,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 65 transitions, 137 flow [2024-11-20 17:36:08,392 INFO L124 PetriNetUnfolderBase]: 10/64 cut-off events. [2024-11-20 17:36:08,392 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 17:36:08,398 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-20 17:36:08,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 65 transitions, 137 flow [2024-11-20 17:36:08,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 63 transitions, 132 flow [2024-11-20 17:36:08,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:36:08,426 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;@23e5b6a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:36:08,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-20 17:36:08,438 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:36:08,439 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-11-20 17:36:08,439 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 17:36:08,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:08,440 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:08,441 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-20 17:36:08,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:08,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2064971934, now seen corresponding path program 1 times [2024-11-20 17:36:08,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:36:08,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116074064] [2024-11-20 17:36:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:36:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:08,794 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-20 17:36:08,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:36:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116074064] [2024-11-20 17:36:08,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116074064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:08,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:08,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:36:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041220298] [2024-11-20 17:36:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:08,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:36:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:36:08,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:36:08,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:36:08,908 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-20 17:36:08,911 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-20 17:36:08,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:08,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-20 17:36:08,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:09,069 INFO L124 PetriNetUnfolderBase]: 96/385 cut-off events. [2024-11-20 17:36:09,070 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 17:36:09,072 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-20 17:36:09,079 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-20 17:36:09,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 156 flow [2024-11-20 17:36:09,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:36:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:36:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-20 17:36:09,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6102564102564103 [2024-11-20 17:36:09,091 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 132 flow. Second operand 3 states and 119 transitions. [2024-11-20 17:36:09,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 156 flow [2024-11-20 17:36:09,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:36:09,097 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 108 flow [2024-11-20 17:36:09,100 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-20 17:36:09,105 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2024-11-20 17:36:09,106 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 108 flow [2024-11-20 17:36:09,107 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-20 17:36:09,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:09,107 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:09,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:36:09,108 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-20 17:36:09,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2064971935, now seen corresponding path program 1 times [2024-11-20 17:36:09,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:36:09,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179780420] [2024-11-20 17:36:09,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:09,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:36:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:09,286 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-20 17:36:09,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:36:09,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179780420] [2024-11-20 17:36:09,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179780420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:09,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:09,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:36:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510192663] [2024-11-20 17:36:09,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:09,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:36:09,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:36:09,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:36:09,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:36:09,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-20 17:36:09,306 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-20 17:36:09,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:09,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-20 17:36:09,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:09,401 INFO L124 PetriNetUnfolderBase]: 96/383 cut-off events. [2024-11-20 17:36:09,401 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:36:09,403 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-20 17:36:09,404 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-20 17:36:09,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 154 flow [2024-11-20 17:36:09,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:36:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:36:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-20 17:36:09,408 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2024-11-20 17:36:09,408 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 108 flow. Second operand 3 states and 109 transitions. [2024-11-20 17:36:09,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 154 flow [2024-11-20 17:36:09,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:36:09,412 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 106 flow [2024-11-20 17:36:09,412 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-20 17:36:09,414 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-20 17:36:09,414 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 106 flow [2024-11-20 17:36:09,415 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-20 17:36:09,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:09,415 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:09,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 17:36:09,416 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-20 17:36:09,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:09,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1468347495, now seen corresponding path program 1 times [2024-11-20 17:36:09,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:36:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688996386] [2024-11-20 17:36:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:09,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:36:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:09,535 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-20 17:36:09,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:36:09,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688996386] [2024-11-20 17:36:09,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688996386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:09,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:09,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:36:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816190682] [2024-11-20 17:36:09,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:09,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:36:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:36:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:36:09,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:36:09,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-20 17:36:09,585 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-20 17:36:09,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:09,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-20 17:36:09,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:09,721 INFO L124 PetriNetUnfolderBase]: 96/342 cut-off events. [2024-11-20 17:36:09,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:36:09,723 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-20 17:36:09,724 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-11-20 17:36:09,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 178 flow [2024-11-20 17:36:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:36:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:36:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-20 17:36:09,729 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-11-20 17:36:09,729 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 106 flow. Second operand 5 states and 156 transitions. [2024-11-20 17:36:09,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 178 flow [2024-11-20 17:36:09,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:36:09,734 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 102 flow [2024-11-20 17:36:09,734 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-20 17:36:09,735 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-20 17:36:09,735 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 102 flow [2024-11-20 17:36:09,735 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-20 17:36:09,735 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:09,735 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:09,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:36:09,736 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-20 17:36:09,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1468347496, now seen corresponding path program 1 times [2024-11-20 17:36:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:36:09,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353403201] [2024-11-20 17:36:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:09,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:36:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:09,844 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-20 17:36:09,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:36:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353403201] [2024-11-20 17:36:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353403201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:09,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:09,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:36:09,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907863249] [2024-11-20 17:36:09,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:09,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:36:09,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:36:09,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:36:09,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:36:09,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-20 17:36:09,900 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-20 17:36:09,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:09,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-20 17:36:09,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:10,004 INFO L124 PetriNetUnfolderBase]: 96/306 cut-off events. [2024-11-20 17:36:10,005 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-20 17:36:10,006 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-20 17:36:10,007 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2024-11-20 17:36:10,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 174 flow [2024-11-20 17:36:10,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:36:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:36:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-11-20 17:36:10,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-11-20 17:36:10,009 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 102 flow. Second operand 6 states and 180 transitions. [2024-11-20 17:36:10,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 174 flow [2024-11-20 17:36:10,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:36:10,011 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 94 flow [2024-11-20 17:36:10,011 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-20 17:36:10,012 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2024-11-20 17:36:10,012 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 94 flow [2024-11-20 17:36:10,013 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-20 17:36:10,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:10,013 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:10,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 17:36:10,013 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-20 17:36:10,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:10,014 INFO L85 PathProgramCache]: Analyzing trace with hash 762681113, now seen corresponding path program 1 times [2024-11-20 17:36:10,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:36:10,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789470159] [2024-11-20 17:36:10,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:10,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:36:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:10,084 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-20 17:36:10,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:36:10,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789470159] [2024-11-20 17:36:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789470159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:10,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:10,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:36:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503501746] [2024-11-20 17:36:10,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:10,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:36:10,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:36:10,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:36:10,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:36:10,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-20 17:36:10,093 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-20 17:36:10,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:10,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-20 17:36:10,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:10,211 INFO L124 PetriNetUnfolderBase]: 110/346 cut-off events. [2024-11-20 17:36:10,211 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-20 17:36:10,212 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-20 17:36:10,214 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-20 17:36:10,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 230 flow [2024-11-20 17:36:10,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:36:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:36:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2024-11-20 17:36:10,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5784615384615385 [2024-11-20 17:36:10,217 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 94 flow. Second operand 5 states and 188 transitions. [2024-11-20 17:36:10,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 230 flow [2024-11-20 17:36:10,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:36:10,222 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 131 flow [2024-11-20 17:36:10,222 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-20 17:36:10,223 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2024-11-20 17:36:10,223 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 131 flow [2024-11-20 17:36:10,223 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-20 17:36:10,223 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:10,223 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-20 17:36:10,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 17:36:10,224 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-20 17:36:10,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1246641382, now seen corresponding path program 1 times [2024-11-20 17:36:10,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:36:10,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991409828] [2024-11-20 17:36:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:10,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:36:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:10,404 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-20 17:36:10,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:36:10,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991409828] [2024-11-20 17:36:10,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991409828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:10,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:10,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:36:10,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593522732] [2024-11-20 17:36:10,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:10,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:36:10,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:36:10,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:36:10,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:36:10,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-20 17:36:10,407 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-20 17:36:10,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:10,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-20 17:36:10,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:10,504 INFO L124 PetriNetUnfolderBase]: 60/237 cut-off events. [2024-11-20 17:36:10,504 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-20 17:36:10,505 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-20 17:36:10,506 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 29 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2024-11-20 17:36:10,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 231 flow [2024-11-20 17:36:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:36:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:36:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2024-11-20 17:36:10,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5923076923076923 [2024-11-20 17:36:10,509 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 131 flow. Second operand 4 states and 154 transitions. [2024-11-20 17:36:10,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 231 flow [2024-11-20 17:36:10,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 224 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-20 17:36:10,512 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 152 flow [2024-11-20 17:36:10,513 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-20 17:36:10,514 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-11-20 17:36:10,515 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 152 flow [2024-11-20 17:36:10,515 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-20 17:36:10,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:10,516 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-20 17:36:10,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 17:36:10,516 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-20 17:36:10,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2107059513, now seen corresponding path program 1 times [2024-11-20 17:36:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:36:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711118763] [2024-11-20 17:36:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:36:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:36:10,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:36:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:36:10,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 17:36:10,583 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:36:10,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2024-11-20 17:36:10,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-20 17:36:10,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-20 17:36:10,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (17 of 21 remaining) [2024-11-20 17:36:10,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 21 remaining) [2024-11-20 17:36:10,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-20 17:36:10,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-20 17:36:10,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-20 17:36:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-20 17:36:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-20 17:36:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-20 17:36:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-20 17:36:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-20 17:36:10,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-20 17:36:10,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-20 17:36:10,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-20 17:36:10,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-20 17:36:10,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-20 17:36:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-20 17:36:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-20 17:36:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2024-11-20 17:36:10,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 17:36:10,594 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:10,647 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:36:10,648 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:36:10,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:36:10 BasicIcfg [2024-11-20 17:36:10,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:36:10,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:36:10,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:36:10,658 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:36:10,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:36:08" (3/4) ... [2024-11-20 17:36:10,660 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:36:10,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:36:10,662 INFO L158 Benchmark]: Toolchain (without parser) took 3848.04ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 93.5MB in the beginning and 131.8MB in the end (delta: -38.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-20 17:36:10,662 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:36:10,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.33ms. Allocated memory is still 163.6MB. Free memory was 93.3MB in the beginning and 123.8MB in the end (delta: -30.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-20 17:36:10,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.03ms. Allocated memory is still 163.6MB. Free memory was 123.8MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:36:10,663 INFO L158 Benchmark]: Boogie Preprocessor took 69.68ms. Allocated memory is still 163.6MB. Free memory was 121.6MB in the beginning and 119.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:36:10,663 INFO L158 Benchmark]: RCFGBuilder took 652.37ms. Allocated memory is still 163.6MB. Free memory was 119.0MB in the beginning and 81.0MB in the end (delta: 38.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-20 17:36:10,664 INFO L158 Benchmark]: TraceAbstraction took 2439.59ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 79.7MB in the beginning and 131.8MB in the end (delta: -52.1MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-11-20 17:36:10,664 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 218.1MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:36:10,669 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 614.33ms. Allocated memory is still 163.6MB. Free memory was 93.3MB in the beginning and 123.8MB in the end (delta: -30.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.03ms. Allocated memory is still 163.6MB. Free memory was 123.8MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.68ms. Allocated memory is still 163.6MB. Free memory was 121.6MB in the beginning and 119.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 652.37ms. Allocated memory is still 163.6MB. Free memory was 119.0MB in the beginning and 81.0MB in the end (delta: 38.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2439.59ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 79.7MB in the beginning and 131.8MB in the end (delta: -52.1MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 218.1MB. Free memory is still 131.8MB. 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.3s, 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.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.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-20 17:36:10,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.dd.update-z3-fca748b-m [2024-11-20 17:36:12,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:36:13,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 17:36:13,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:36:13,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:36:13,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:36:13,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:36:13,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:36:13,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:36:13,090 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:36:13,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:36:13,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:36:13,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:36:13,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:36:13,094 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:36:13,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:36:13,095 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:36:13,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:36:13,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:36:13,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:36:13,099 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:36:13,100 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:36:13,100 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:36:13,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:36:13,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:36:13,101 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 17:36:13,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:36:13,101 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 17:36:13,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:36:13,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:36:13,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:36:13,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:36:13,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:36:13,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:36:13,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:36:13,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:36:13,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:36:13,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:36:13,104 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 17:36:13,104 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 17:36:13,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:36:13,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:36:13,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:36:13,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:36:13,107 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-20 17:36:13,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:36:13,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:36:13,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:36:13,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:36:13,468 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:36:13,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-20 17:36:15,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:36:15,350 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:36:15,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_45-escape_racing.i [2024-11-20 17:36:15,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0e297f7/f866a791eda4421b942abe83e07b30c9/FLAGa1aed5c14 [2024-11-20 17:36:15,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0e297f7/f866a791eda4421b942abe83e07b30c9 [2024-11-20 17:36:15,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:36:15,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:36:15,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:36:15,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:36:15,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:36:15,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:15,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c10920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15, skipping insertion in model container [2024-11-20 17:36:15,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:15,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:36:15,826 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-20 17:36:15,835 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-20 17:36:15,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:36:15,869 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:36:15,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:36:15,960 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:36:15,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15 WrapperNode [2024-11-20 17:36:15,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:36:15,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:36:15,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:36:15,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:36:15,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:15,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:16,014 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2024-11-20 17:36:16,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:36:16,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:36:16,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:36:16,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:36:16,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:16,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:16,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:16,061 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 5, 6, 5, 5]. 26 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 1, 5, 5]. The 2 writes are split as follows [0, 0, 2, 0, 0]. [2024-11-20 17:36:16,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:16,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:16,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:16,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:16,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:16,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:16,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:36:16,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:36:16,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:36:16,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:36:16,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (1/1) ... [2024-11-20 17:36:16,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:36:16,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:36:16,133 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-20 17:36:16,146 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-20 17:36:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 17:36:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 17:36:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 17:36:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-20 17:36:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-20 17:36:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 17:36:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:36:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 17:36:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-20 17:36:16,183 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-20 17:36:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 17:36:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 17:36:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 17:36:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 17:36:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-20 17:36:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-20 17:36:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 17:36:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 17:36:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 17:36:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 17:36:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 17:36:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 17:36:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 17:36:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 17:36:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-20 17:36:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-20 17:36:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 17:36:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:36:16,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:36:16,188 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:36:16,390 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:36:16,392 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:36:16,714 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:36:16,715 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:36:16,960 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:36:16,960 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-20 17:36:16,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:36:16 BoogieIcfgContainer [2024-11-20 17:36:16,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:36:16,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:36:16,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:36:16,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:36:16,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:36:15" (1/3) ... [2024-11-20 17:36:16,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c400cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:36:16, skipping insertion in model container [2024-11-20 17:36:16,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:36:15" (2/3) ... [2024-11-20 17:36:16,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c400cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:36:16, skipping insertion in model container [2024-11-20 17:36:16,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:36:16" (3/3) ... [2024-11-20 17:36:16,971 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_45-escape_racing.i [2024-11-20 17:36:16,986 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:36:16,987 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-20 17:36:16,987 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:36:17,050 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-20 17:36:17,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 65 transitions, 137 flow [2024-11-20 17:36:17,122 INFO L124 PetriNetUnfolderBase]: 10/64 cut-off events. [2024-11-20 17:36:17,122 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 17:36:17,127 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-20 17:36:17,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 65 transitions, 137 flow [2024-11-20 17:36:17,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 63 transitions, 132 flow [2024-11-20 17:36:17,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:36:17,152 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;@712c4869, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:36:17,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-20 17:36:17,163 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:36:17,167 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-11-20 17:36:17,167 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 17:36:17,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:17,168 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:17,169 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-20 17:36:17,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:17,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1205167714, now seen corresponding path program 1 times [2024-11-20 17:36:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:36:17,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513286644] [2024-11-20 17:36:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:17,190 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-20 17:36:17,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:36:17,194 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-20 17:36:17,195 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-20 17:36:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:17,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:36:17,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:36:17,398 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-20 17:36:17,431 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-20 17:36:17,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:36:17,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:36:17,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513286644] [2024-11-20 17:36:17,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513286644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:17,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:17,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:36:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51691690] [2024-11-20 17:36:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:17,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:36:17,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:36:17,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:36:17,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:36:17,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-20 17:36:17,500 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-20 17:36:17,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:17,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-20 17:36:17,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:17,667 INFO L124 PetriNetUnfolderBase]: 96/385 cut-off events. [2024-11-20 17:36:17,667 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 17:36:17,669 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-20 17:36:17,672 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-20 17:36:17,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 156 flow [2024-11-20 17:36:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:36:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:36:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-20 17:36:17,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6102564102564103 [2024-11-20 17:36:17,702 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 132 flow. Second operand 3 states and 119 transitions. [2024-11-20 17:36:17,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 156 flow [2024-11-20 17:36:17,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:36:17,719 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 108 flow [2024-11-20 17:36:17,722 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-20 17:36:17,730 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2024-11-20 17:36:17,730 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 108 flow [2024-11-20 17:36:17,730 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-20 17:36:17,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:17,731 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:17,737 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-20 17:36:17,931 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-20 17:36:17,932 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-20 17:36:17,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1205167713, now seen corresponding path program 1 times [2024-11-20 17:36:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:36:17,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328873995] [2024-11-20 17:36:17,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:17,934 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-20 17:36:17,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:36:17,938 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-20 17:36:17,939 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-20 17:36:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:18,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:36:18,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:36:18,081 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-20 17:36:18,145 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-20 17:36:18,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:36:18,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:36:18,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328873995] [2024-11-20 17:36:18,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328873995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:18,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:18,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:36:18,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880083939] [2024-11-20 17:36:18,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:18,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:36:18,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:36:18,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:36:18,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:36:18,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 65 [2024-11-20 17:36:18,179 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-20 17:36:18,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:18,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 65 [2024-11-20 17:36:18,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:18,298 INFO L124 PetriNetUnfolderBase]: 96/383 cut-off events. [2024-11-20 17:36:18,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:36:18,299 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-20 17:36:18,303 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 22 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-20 17:36:18,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 154 flow [2024-11-20 17:36:18,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:36:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:36:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-20 17:36:18,306 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2024-11-20 17:36:18,306 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 108 flow. Second operand 3 states and 109 transitions. [2024-11-20 17:36:18,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 154 flow [2024-11-20 17:36:18,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:36:18,311 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 106 flow [2024-11-20 17:36:18,311 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-20 17:36:18,312 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-20 17:36:18,312 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 106 flow [2024-11-20 17:36:18,312 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-20 17:36:18,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:18,318 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:18,323 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-20 17:36:18,522 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-20 17:36:18,523 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-20 17:36:18,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1121733783, now seen corresponding path program 1 times [2024-11-20 17:36:18,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:36:18,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299572623] [2024-11-20 17:36:18,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:18,526 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-20 17:36:18,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:36:18,528 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-20 17:36:18,531 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-20 17:36:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:18,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:36:18,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:36:18,626 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-20 17:36:18,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:36:18,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:36:18,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:36:18,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299572623] [2024-11-20 17:36:18,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299572623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:18,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:18,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:36:18,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591628923] [2024-11-20 17:36:18,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:18,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:36:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:36:18,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:36:18,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:36:18,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-20 17:36:18,729 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-20 17:36:18,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:18,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-20 17:36:18,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:18,883 INFO L124 PetriNetUnfolderBase]: 96/342 cut-off events. [2024-11-20 17:36:18,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:36:18,885 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-20 17:36:18,887 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-11-20 17:36:18,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 178 flow [2024-11-20 17:36:18,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:36:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:36:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-20 17:36:18,890 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-11-20 17:36:18,890 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 106 flow. Second operand 5 states and 156 transitions. [2024-11-20 17:36:18,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 178 flow [2024-11-20 17:36:18,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:36:18,892 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 102 flow [2024-11-20 17:36:18,892 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-20 17:36:18,893 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-20 17:36:18,893 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 102 flow [2024-11-20 17:36:18,893 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-20 17:36:18,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:18,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:18,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 17:36:19,093 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-20 17:36:19,094 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-20 17:36:19,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:19,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1121733782, now seen corresponding path program 1 times [2024-11-20 17:36:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:36:19,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938714592] [2024-11-20 17:36:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:19,096 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-20 17:36:19,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:36:19,098 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-20 17:36:19,099 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-20 17:36:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:19,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 17:36:19,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:36:19,180 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-20 17:36:19,274 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-20 17:36:19,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:36:19,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:36:19,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938714592] [2024-11-20 17:36:19,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938714592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:19,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:19,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:36:19,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196704706] [2024-11-20 17:36:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:19,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:36:19,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:36:19,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:36:19,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:36:19,318 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 65 [2024-11-20 17:36:19,319 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-20 17:36:19,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:19,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 65 [2024-11-20 17:36:19,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:19,474 INFO L124 PetriNetUnfolderBase]: 96/322 cut-off events. [2024-11-20 17:36:19,474 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-20 17:36:19,475 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-20 17:36:19,476 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 28 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2024-11-20 17:36:19,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 174 flow [2024-11-20 17:36:19,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:36:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:36:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-11-20 17:36:19,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-11-20 17:36:19,479 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 102 flow. Second operand 6 states and 180 transitions. [2024-11-20 17:36:19,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 174 flow [2024-11-20 17:36:19,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:36:19,480 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 94 flow [2024-11-20 17:36:19,481 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-20 17:36:19,481 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2024-11-20 17:36:19,482 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 94 flow [2024-11-20 17:36:19,482 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-20 17:36:19,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:19,482 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:19,486 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-20 17:36:19,685 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-20 17:36:19,686 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-20 17:36:19,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1519362597, now seen corresponding path program 1 times [2024-11-20 17:36:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:36:19,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510939930] [2024-11-20 17:36:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:19,687 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-20 17:36:19,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:36:19,690 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-20 17:36:19,690 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-20 17:36:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:19,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:36:19,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:36:19,800 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-20 17:36:19,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:36:19,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:36:19,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510939930] [2024-11-20 17:36:19,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510939930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:19,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:19,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:36:19,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117690350] [2024-11-20 17:36:19,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:19,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:36:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:36:19,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:36:19,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:36:19,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-20 17:36:19,812 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-20 17:36:19,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:19,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-20 17:36:19,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:19,971 INFO L124 PetriNetUnfolderBase]: 98/327 cut-off events. [2024-11-20 17:36:19,971 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-20 17:36:19,972 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-20 17:36:19,973 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 38 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2024-11-20 17:36:19,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 224 flow [2024-11-20 17:36:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:36:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:36:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2024-11-20 17:36:19,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5876923076923077 [2024-11-20 17:36:19,975 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 94 flow. Second operand 5 states and 191 transitions. [2024-11-20 17:36:19,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 224 flow [2024-11-20 17:36:19,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 215 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:36:19,978 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 124 flow [2024-11-20 17:36:19,978 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-20 17:36:19,980 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-11-20 17:36:19,980 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 124 flow [2024-11-20 17:36:19,980 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-20 17:36:19,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:19,981 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-20 17:36:19,985 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-20 17:36:20,181 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-20 17:36:20,182 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-20 17:36:20,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1242200874, now seen corresponding path program 1 times [2024-11-20 17:36:20,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:36:20,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607744144] [2024-11-20 17:36:20,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:20,183 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-20 17:36:20,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:36:20,185 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-20 17:36:20,186 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-20 17:36:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:36:20,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:36:20,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:36:20,312 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-20 17:36:20,336 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-20 17:36:20,383 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-20 17:36:20,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:36:20,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:36:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607744144] [2024-11-20 17:36:20,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607744144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:36:20,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:36:20,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:36:20,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238726713] [2024-11-20 17:36:20,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:36:20,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:36:20,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:36:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:36:20,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:36:20,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2024-11-20 17:36:20,388 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-20 17:36:20,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:36:20,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2024-11-20 17:36:20,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:36:20,548 INFO L124 PetriNetUnfolderBase]: 56/237 cut-off events. [2024-11-20 17:36:20,549 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-20 17:36:20,549 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-20 17:36:20,550 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 31 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-11-20 17:36:20,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 220 flow [2024-11-20 17:36:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:36:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:36:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2024-11-20 17:36:20,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-20 17:36:20,553 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 124 flow. Second operand 4 states and 156 transitions. [2024-11-20 17:36:20,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 220 flow [2024-11-20 17:36:20,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 218 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-20 17:36:20,556 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 146 flow [2024-11-20 17:36:20,558 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-20 17:36:20,558 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-20 17:36:20,558 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 146 flow [2024-11-20 17:36:20,559 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-20 17:36:20,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:36:20,560 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-20 17:36:20,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-20 17:36:20,760 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-20 17:36:20,761 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-20 17:36:20,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:36:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1337138261, now seen corresponding path program 1 times [2024-11-20 17:36:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:36:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740038520] [2024-11-20 17:36:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:36:20,762 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-20 17:36:20,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:36:20,763 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-20 17:36:20,764 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-20 17:36:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:36:20,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:36:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:36:20,910 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 17:36:20,911 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:36:20,912 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2024-11-20 17:36:20,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-20 17:36:20,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-20 17:36:20,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (17 of 21 remaining) [2024-11-20 17:36:20,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 21 remaining) [2024-11-20 17:36:20,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-20 17:36:20,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-20 17:36:20,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-20 17:36:20,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-20 17:36:20,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-20 17:36:20,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-20 17:36:20,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-20 17:36:20,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-20 17:36:20,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-20 17:36:20,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-20 17:36:20,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-20 17:36:20,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-20 17:36:20,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-20 17:36:20,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-20 17:36:20,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-20 17:36:20,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2024-11-20 17:36:20,926 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-20 17:36:21,117 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-20 17:36:21,118 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:36:21,152 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:36:21,152 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:36:21,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:36:21 BasicIcfg [2024-11-20 17:36:21,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:36:21,157 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:36:21,157 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:36:21,157 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:36:21,158 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:36:16" (3/4) ... [2024-11-20 17:36:21,159 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:36:21,160 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:36:21,161 INFO L158 Benchmark]: Toolchain (without parser) took 5763.14ms. Allocated memory was 73.4MB in the beginning and 115.3MB in the end (delta: 41.9MB). Free memory was 41.9MB in the beginning and 69.9MB in the end (delta: -28.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-20 17:36:21,161 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 48.2MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:36:21,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.52ms. Allocated memory is still 73.4MB. Free memory was 41.7MB in the beginning and 36.8MB in the end (delta: 4.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-11-20 17:36:21,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.98ms. Allocated memory is still 73.4MB. Free memory was 36.8MB in the beginning and 34.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:36:21,166 INFO L158 Benchmark]: Boogie Preprocessor took 78.21ms. Allocated memory is still 73.4MB. Free memory was 34.5MB in the beginning and 31.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 17:36:21,167 INFO L158 Benchmark]: RCFGBuilder took 867.07ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 31.5MB in the beginning and 60.6MB in the end (delta: -29.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-11-20 17:36:21,167 INFO L158 Benchmark]: TraceAbstraction took 4193.98ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 60.0MB in the beginning and 69.9MB in the end (delta: -9.8MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-20 17:36:21,167 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 115.3MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:36:21,169 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.96ms. Allocated memory is still 48.2MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.52ms. Allocated memory is still 73.4MB. Free memory was 41.7MB in the beginning and 36.8MB in the end (delta: 4.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.98ms. Allocated memory is still 73.4MB. Free memory was 36.8MB in the beginning and 34.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.21ms. Allocated memory is still 73.4MB. Free memory was 34.5MB in the beginning and 31.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 867.07ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 31.5MB in the beginning and 60.6MB in the end (delta: -29.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4193.98ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 60.0MB in the beginning and 69.9MB in the end (delta: -9.8MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 115.3MB. Free memory is still 69.9MB. 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-20 17:36:21,193 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