./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:43:49,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:43:49,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:43:49,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:43:49,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:43:49,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:43:49,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:43:49,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:43:49,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:43:49,226 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:43:49,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:43:49,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:43:49,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:43:49,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:43:49,229 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:43:49,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:43:49,230 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:43:49,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:43:49,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:43:49,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:43:49,231 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:43:49,234 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:43:49,234 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:43:49,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:43:49,235 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:43:49,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:43:49,235 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:43:49,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:43:49,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:43:49,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:43:49,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:43:49,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:43:49,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:43:49,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:43:49,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:43:49,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:43:49,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:43:49,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:43:49,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:43:49,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:43:49,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:43:49,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:43:49,240 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-clean/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-clean/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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2024-10-11 19:43:49,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:43:49,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:43:49,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:43:49,601 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:43:49,601 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:43:49,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-10-11 19:43:51,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:43:51,328 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:43:51,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-10-11 19:43:51,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/737fbf138/a7078c060b0f45e180bc33a6693fecfa/FLAG7de8f49dc [2024-10-11 19:43:51,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/737fbf138/a7078c060b0f45e180bc33a6693fecfa [2024-10-11 19:43:51,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:43:51,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:43:51,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:43:51,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:43:51,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:43:51,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:43:51" (1/1) ... [2024-10-11 19:43:51,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15286238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:51, skipping insertion in model container [2024-10-11 19:43:51,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:43:51" (1/1) ... [2024-10-11 19:43:51,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:43:51,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:43:51,937 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:43:52,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:43:52,103 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:43:52,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52 WrapperNode [2024-10-11 19:43:52,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:43:52,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:43:52,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:43:52,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:43:52,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,172 INFO L138 Inliner]: procedures = 364, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-10-11 19:43:52,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:43:52,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:43:52,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:43:52,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:43:52,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,211 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 19:43:52,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:43:52,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:43:52,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:43:52,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:43:52,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (1/1) ... [2024-10-11 19:43:52,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:43:52,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:43:52,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:43:52,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:43:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:43:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:43:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-10-11 19:43:52,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-10-11 19:43:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:43:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:43:52,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:43:52,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:43:52,334 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:43:52,502 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:43:52,504 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:43:52,632 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:43:52,632 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:43:52,732 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:43:52,733 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 19:43:52,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:43:52 BoogieIcfgContainer [2024-10-11 19:43:52,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:43:52,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:43:52,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:43:52,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:43:52,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:43:51" (1/3) ... [2024-10-11 19:43:52,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655724ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:43:52, skipping insertion in model container [2024-10-11 19:43:52,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:43:52" (2/3) ... [2024-10-11 19:43:52,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655724ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:43:52, skipping insertion in model container [2024-10-11 19:43:52,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:43:52" (3/3) ... [2024-10-11 19:43:52,745 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-10-11 19:43:52,757 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:43:52,757 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 19:43:52,757 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:43:52,789 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 19:43:52,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2024-10-11 19:43:52,847 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-10-11 19:43:52,847 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:43:52,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 26 events. 4/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2024-10-11 19:43:52,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2024-10-11 19:43:52,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2024-10-11 19:43:52,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:43:52,866 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;@4581394e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:43:52,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 19:43:52,874 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:43:52,874 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2024-10-11 19:43:52,874 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:43:52,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:52,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:52,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:43:52,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:52,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1903401860, now seen corresponding path program 1 times [2024-10-11 19:43:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:43:52,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720385658] [2024-10-11 19:43:52,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:43:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:43:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:43:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:43:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:43:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720385658] [2024-10-11 19:43:53,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720385658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:43:53,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:43:53,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:43:53,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260516849] [2024-10-11 19:43:53,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:43:53,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:43:53,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:43:53,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:43:53,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:43:53,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-10-11 19:43:53,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-11 19:43:53,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:43:53,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-10-11 19:43:53,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:43:53,245 INFO L124 PetriNetUnfolderBase]: 17/56 cut-off events. [2024-10-11 19:43:53,245 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:43:53,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 56 events. 17/56 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 138 event pairs, 6 based on Foata normal form. 7/59 useless extension candidates. Maximal degree in co-relation 80. Up to 30 conditions per place. [2024-10-11 19:43:53,247 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 15 selfloop transitions, 2 changer transitions 1/25 dead transitions. [2024-10-11 19:43:53,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 25 transitions, 90 flow [2024-10-11 19:43:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:43:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:43:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2024-10-11 19:43:53,259 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-10-11 19:43:53,261 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 3 states and 51 transitions. [2024-10-11 19:43:53,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 25 transitions, 90 flow [2024-10-11 19:43:53,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 25 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:43:53,265 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2024-10-11 19:43:53,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2024-10-11 19:43:53,270 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2024-10-11 19:43:53,270 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2024-10-11 19:43:53,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-11 19:43:53,270 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:53,270 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:53,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:43:53,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:43:53,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:53,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1055756235, now seen corresponding path program 1 times [2024-10-11 19:43:53,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:43:53,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355837243] [2024-10-11 19:43:53,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:43:53,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:43:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:43:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:43:53,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:43:53,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355837243] [2024-10-11 19:43:53,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355837243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:43:53,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:43:53,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:43:53,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748065177] [2024-10-11 19:43:53,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:43:53,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:43:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:43:53,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:43:53,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:43:53,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-10-11 19:43:53,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-10-11 19:43:53,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:43:53,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-10-11 19:43:53,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:43:53,436 INFO L124 PetriNetUnfolderBase]: 25/82 cut-off events. [2024-10-11 19:43:53,436 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-11 19:43:53,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 82 events. 25/82 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 226 event pairs, 9 based on Foata normal form. 4/82 useless extension candidates. Maximal degree in co-relation 38. Up to 38 conditions per place. [2024-10-11 19:43:53,440 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 17 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2024-10-11 19:43:53,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 26 transitions, 112 flow [2024-10-11 19:43:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:43:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:43:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-10-11 19:43:53,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-10-11 19:43:53,443 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 48 transitions. [2024-10-11 19:43:53,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 26 transitions, 112 flow [2024-10-11 19:43:53,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:43:53,445 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 62 flow [2024-10-11 19:43:53,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2024-10-11 19:43:53,447 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2024-10-11 19:43:53,447 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 62 flow [2024-10-11 19:43:53,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-10-11 19:43:53,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:53,448 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-10-11 19:43:53,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:43:53,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:43:53,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:53,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1776145626, now seen corresponding path program 1 times [2024-10-11 19:43:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:43:53,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224594848] [2024-10-11 19:43:53,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:43:53,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:43:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:43:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:43:53,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:43:53,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224594848] [2024-10-11 19:43:53,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224594848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:43:53,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834291516] [2024-10-11 19:43:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:43:53,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:43:53,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:43:53,577 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:43:53,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 19:43:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:43:53,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:43:53,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:43:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 19:43:53,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:43:53,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 19:43:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834291516] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:43:53,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:43:53,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-11 19:43:53,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350081605] [2024-10-11 19:43:53,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:43:53,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:43:53,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:43:53,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:43:53,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:43:53,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:43:53,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 62 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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-10-11 19:43:53,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:43:53,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:43:53,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:43:54,092 INFO L124 PetriNetUnfolderBase]: 76/215 cut-off events. [2024-10-11 19:43:54,093 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-10-11 19:43:54,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 215 events. 76/215 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 688 event pairs, 4 based on Foata normal form. 30/244 useless extension candidates. Maximal degree in co-relation 113. Up to 61 conditions per place. [2024-10-11 19:43:54,095 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 42 selfloop transitions, 33 changer transitions 0/81 dead transitions. [2024-10-11 19:43:54,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 81 transitions, 406 flow [2024-10-11 19:43:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 19:43:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-11 19:43:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 233 transitions. [2024-10-11 19:43:54,103 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5393518518518519 [2024-10-11 19:43:54,105 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 62 flow. Second operand 16 states and 233 transitions. [2024-10-11 19:43:54,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 81 transitions, 406 flow [2024-10-11 19:43:54,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 81 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:43:54,109 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 334 flow [2024-10-11 19:43:54,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=334, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2024-10-11 19:43:54,111 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 26 predicate places. [2024-10-11 19:43:54,111 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 334 flow [2024-10-11 19:43:54,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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-10-11 19:43:54,112 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:54,112 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:54,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 19:43:54,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:43:54,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:43:54,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:54,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1872952531, now seen corresponding path program 2 times [2024-10-11 19:43:54,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:43:54,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158778319] [2024-10-11 19:43:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:43:54,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:43:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:43:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 19:43:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:43:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158778319] [2024-10-11 19:43:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158778319] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:43:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900587769] [2024-10-11 19:43:54,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:43:54,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:43:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:43:54,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:43:54,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 19:43:54,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:43:54,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:43:54,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:43:54,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:43:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 19:43:54,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:43:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 19:43:54,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900587769] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:43:54,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:43:54,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-11 19:43:54,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597761797] [2024-10-11 19:43:54,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:43:54,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:43:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:43:54,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:43:54,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:43:54,664 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:43:54,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 334 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:43:54,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:43:54,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:43:54,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:43:54,830 INFO L124 PetriNetUnfolderBase]: 175/501 cut-off events. [2024-10-11 19:43:54,831 INFO L125 PetriNetUnfolderBase]: For 3066/3066 co-relation queries the response was YES. [2024-10-11 19:43:54,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 501 events. 175/501 cut-off events. For 3066/3066 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2305 event pairs, 41 based on Foata normal form. 59/546 useless extension candidates. Maximal degree in co-relation 1459. Up to 121 conditions per place. [2024-10-11 19:43:54,838 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 61 selfloop transitions, 20 changer transitions 0/90 dead transitions. [2024-10-11 19:43:54,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 846 flow [2024-10-11 19:43:54,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:43:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:43:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-10-11 19:43:54,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-10-11 19:43:54,840 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 334 flow. Second operand 8 states and 124 transitions. [2024-10-11 19:43:54,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 846 flow [2024-10-11 19:43:54,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 770 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-10-11 19:43:54,852 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 404 flow [2024-10-11 19:43:54,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-10-11 19:43:54,853 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 36 predicate places. [2024-10-11 19:43:54,853 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 404 flow [2024-10-11 19:43:54,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:43:54,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:54,854 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:54,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 19:43:55,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:43:55,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:43:55,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1655872447, now seen corresponding path program 3 times [2024-10-11 19:43:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:43:55,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850656430] [2024-10-11 19:43:55,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:43:55,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:43:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:43:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-11 19:43:55,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:43:55,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850656430] [2024-10-11 19:43:55,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850656430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:43:55,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292658467] [2024-10-11 19:43:55,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:43:55,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:43:55,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:43:55,253 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:43:55,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 19:43:55,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-11 19:43:55,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:43:55,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:43:55,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:43:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-11 19:43:55,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:43:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-11 19:43:55,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292658467] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:43:55,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:43:55,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-11 19:43:55,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026000396] [2024-10-11 19:43:55,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:43:55,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:43:55,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:43:55,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:43:55,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:43:55,542 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:43:55,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 404 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-10-11 19:43:55,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:43:55,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:43:55,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:43:55,763 INFO L124 PetriNetUnfolderBase]: 266/767 cut-off events. [2024-10-11 19:43:55,763 INFO L125 PetriNetUnfolderBase]: For 9650/9698 co-relation queries the response was YES. [2024-10-11 19:43:55,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3633 conditions, 767 events. 266/767 cut-off events. For 9650/9698 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3978 event pairs, 16 based on Foata normal form. 56/815 useless extension candidates. Maximal degree in co-relation 3162. Up to 231 conditions per place. [2024-10-11 19:43:55,772 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 144 selfloop transitions, 36 changer transitions 0/187 dead transitions. [2024-10-11 19:43:55,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 187 transitions, 2298 flow [2024-10-11 19:43:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 19:43:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 19:43:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-10-11 19:43:55,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876 [2024-10-11 19:43:55,775 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 404 flow. Second operand 12 states and 185 transitions. [2024-10-11 19:43:55,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 187 transitions, 2298 flow [2024-10-11 19:43:55,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 187 transitions, 2054 flow, removed 88 selfloop flow, removed 2 redundant places. [2024-10-11 19:43:55,794 INFO L231 Difference]: Finished difference. Result has 77 places, 74 transitions, 632 flow [2024-10-11 19:43:55,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=632, PETRI_PLACES=77, PETRI_TRANSITIONS=74} [2024-10-11 19:43:55,796 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 52 predicate places. [2024-10-11 19:43:55,797 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 632 flow [2024-10-11 19:43:55,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-10-11 19:43:55,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:55,798 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:55,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 19:43:55,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:43:55,999 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:43:56,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2068348941, now seen corresponding path program 4 times [2024-10-11 19:43:56,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:43:56,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274241735] [2024-10-11 19:43:56,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:43:56,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:43:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:43:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-11 19:43:56,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:43:56,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274241735] [2024-10-11 19:43:56,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274241735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:43:56,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623468859] [2024-10-11 19:43:56,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:43:56,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:43:56,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:43:56,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:43:56,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 19:43:56,310 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:43:56,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:43:56,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:43:56,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:43:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-11 19:43:56,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:43:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-11 19:43:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623468859] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:43:56,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:43:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-10-11 19:43:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625689742] [2024-10-11 19:43:56,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:43:56,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 19:43:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:43:56,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 19:43:56,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-10-11 19:43:56,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:43:56,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 632 flow. Second operand has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 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-10-11 19:43:56,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:43:56,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:43:56,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:43:57,129 INFO L124 PetriNetUnfolderBase]: 758/2054 cut-off events. [2024-10-11 19:43:57,129 INFO L125 PetriNetUnfolderBase]: For 18092/18167 co-relation queries the response was YES. [2024-10-11 19:43:57,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8734 conditions, 2054 events. 758/2054 cut-off events. For 18092/18167 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 12867 event pairs, 96 based on Foata normal form. 291/2293 useless extension candidates. Maximal degree in co-relation 7157. Up to 444 conditions per place. [2024-10-11 19:43:57,149 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 215 selfloop transitions, 28 changer transitions 0/255 dead transitions. [2024-10-11 19:43:57,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 255 transitions, 3026 flow [2024-10-11 19:43:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 19:43:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-11 19:43:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 248 transitions. [2024-10-11 19:43:57,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-10-11 19:43:57,151 INFO L175 Difference]: Start difference. First operand has 77 places, 74 transitions, 632 flow. Second operand 16 states and 248 transitions. [2024-10-11 19:43:57,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 255 transitions, 3026 flow [2024-10-11 19:43:57,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 255 transitions, 2936 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:43:57,176 INFO L231 Difference]: Finished difference. Result has 98 places, 83 transitions, 830 flow [2024-10-11 19:43:57,176 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=830, PETRI_PLACES=98, PETRI_TRANSITIONS=83} [2024-10-11 19:43:57,177 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 73 predicate places. [2024-10-11 19:43:57,177 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 830 flow [2024-10-11 19:43:57,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 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-10-11 19:43:57,178 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:57,178 INFO L204 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:57,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 19:43:57,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 19:43:57,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:43:57,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1218453727, now seen corresponding path program 5 times [2024-10-11 19:43:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:43:57,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516826578] [2024-10-11 19:43:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:43:57,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:43:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:43:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 130 proven. 287 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-11 19:43:57,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:43:57,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516826578] [2024-10-11 19:43:57,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516826578] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:43:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645087264] [2024-10-11 19:43:57,745 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:43:57,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:43:57,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:43:57,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:43:57,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 19:43:57,829 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2024-10-11 19:43:57,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:43:57,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 19:43:57,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:43:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 130 proven. 287 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-11 19:43:57,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:43:58,286 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 130 proven. 287 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-11 19:43:58,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645087264] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:43:58,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:43:58,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-10-11 19:43:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045824511] [2024-10-11 19:43:58,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:43:58,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 19:43:58,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:43:58,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 19:43:58,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:43:58,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:43:58,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 830 flow. Second operand has 23 states, 23 states have (on average 11.521739130434783) internal successors, (265), 23 states have internal predecessors, (265), 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-10-11 19:43:58,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:43:58,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:43:58,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:43:59,002 INFO L124 PetriNetUnfolderBase]: 1046/2822 cut-off events. [2024-10-11 19:43:59,003 INFO L125 PetriNetUnfolderBase]: For 42613/42724 co-relation queries the response was YES. [2024-10-11 19:43:59,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13754 conditions, 2822 events. 1046/2822 cut-off events. For 42613/42724 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 18742 event pairs, 120 based on Foata normal form. 273/3031 useless extension candidates. Maximal degree in co-relation 11228. Up to 630 conditions per place. [2024-10-11 19:43:59,040 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 299 selfloop transitions, 34 changer transitions 0/345 dead transitions. [2024-10-11 19:43:59,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 345 transitions, 4188 flow [2024-10-11 19:43:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 19:43:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 19:43:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 336 transitions. [2024-10-11 19:43:59,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2024-10-11 19:43:59,044 INFO L175 Difference]: Start difference. First operand has 98 places, 83 transitions, 830 flow. Second operand 22 states and 336 transitions. [2024-10-11 19:43:59,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 345 transitions, 4188 flow [2024-10-11 19:43:59,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 345 transitions, 4158 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 19:43:59,089 INFO L231 Difference]: Finished difference. Result has 121 places, 90 transitions, 1020 flow [2024-10-11 19:43:59,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1020, PETRI_PLACES=121, PETRI_TRANSITIONS=90} [2024-10-11 19:43:59,091 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 96 predicate places. [2024-10-11 19:43:59,091 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 90 transitions, 1020 flow [2024-10-11 19:43:59,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.521739130434783) internal successors, (265), 23 states have internal predecessors, (265), 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-10-11 19:43:59,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:43:59,092 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:43:59,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 19:43:59,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:43:59,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:43:59,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:43:59,297 INFO L85 PathProgramCache]: Analyzing trace with hash -949791755, now seen corresponding path program 6 times [2024-10-11 19:43:59,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:43:59,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509118567] [2024-10-11 19:43:59,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:43:59,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:43:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:43:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-11 19:43:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:43:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509118567] [2024-10-11 19:43:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509118567] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:43:59,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922584439] [2024-10-11 19:43:59,614 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 19:43:59,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:43:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:43:59,616 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:43:59,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 19:43:59,707 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-10-11 19:43:59,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:43:59,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:43:59,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:43:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-11 19:43:59,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:44:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-11 19:44:00,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922584439] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:44:00,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:44:00,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2024-10-11 19:44:00,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569677424] [2024-10-11 19:44:00,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:44:00,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 19:44:00,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 19:44:00,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:44:00,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:44:00,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 90 transitions, 1020 flow. Second operand has 23 states, 23 states have (on average 12.26086956521739) internal successors, (282), 23 states have internal predecessors, (282), 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-10-11 19:44:00,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:00,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:44:00,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:01,281 INFO L124 PetriNetUnfolderBase]: 1388/3809 cut-off events. [2024-10-11 19:44:01,281 INFO L125 PetriNetUnfolderBase]: For 99502/99742 co-relation queries the response was YES. [2024-10-11 19:44:01,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23200 conditions, 3809 events. 1388/3809 cut-off events. For 99502/99742 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27467 event pairs, 44 based on Foata normal form. 232/4019 useless extension candidates. Maximal degree in co-relation 21859. Up to 1327 conditions per place. [2024-10-11 19:44:01,345 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 588 selfloop transitions, 66 changer transitions 0/663 dead transitions. [2024-10-11 19:44:01,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 663 transitions, 12386 flow [2024-10-11 19:44:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 19:44:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 19:44:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 339 transitions. [2024-10-11 19:44:01,348 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-10-11 19:44:01,348 INFO L175 Difference]: Start difference. First operand has 121 places, 90 transitions, 1020 flow. Second operand 22 states and 339 transitions. [2024-10-11 19:44:01,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 663 transitions, 12386 flow [2024-10-11 19:44:01,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 663 transitions, 11760 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-10-11 19:44:01,468 INFO L231 Difference]: Finished difference. Result has 140 places, 123 transitions, 1534 flow [2024-10-11 19:44:01,469 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1534, PETRI_PLACES=140, PETRI_TRANSITIONS=123} [2024-10-11 19:44:01,471 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 115 predicate places. [2024-10-11 19:44:01,471 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 123 transitions, 1534 flow [2024-10-11 19:44:01,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.26086956521739) internal successors, (282), 23 states have internal predecessors, (282), 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-10-11 19:44:01,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:01,472 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:01,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 19:44:01,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 19:44:01,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:44:01,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1102348205, now seen corresponding path program 7 times [2024-10-11 19:44:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:01,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336563509] [2024-10-11 19:44:01,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:44:01,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:44:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:44:01,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:44:01,881 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:44:01,882 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2024-10-11 19:44:01,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2024-10-11 19:44:01,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-11 19:44:01,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:44:01,885 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2024-10-11 19:44:02,071 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:44:02,072 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:44:02,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:44:02 BasicIcfg [2024-10-11 19:44:02,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:44:02,082 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:44:02,082 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:44:02,082 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:44:02,083 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:43:52" (3/4) ... [2024-10-11 19:44:02,085 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:44:02,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:44:02,086 INFO L158 Benchmark]: Toolchain (without parser) took 10707.97ms. Allocated memory was 186.6MB in the beginning and 396.4MB in the end (delta: 209.7MB). Free memory was 155.1MB in the beginning and 261.1MB in the end (delta: -106.0MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. [2024-10-11 19:44:02,087 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory was 76.8MB in the beginning and 76.6MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:44:02,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.91ms. Allocated memory is still 186.6MB. Free memory was 155.1MB in the beginning and 114.1MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-11 19:44:02,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.05ms. Allocated memory is still 186.6MB. Free memory was 114.1MB in the beginning and 112.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:44:02,088 INFO L158 Benchmark]: Boogie Preprocessor took 62.52ms. Allocated memory is still 186.6MB. Free memory was 112.1MB in the beginning and 110.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:44:02,089 INFO L158 Benchmark]: RCFGBuilder took 496.10ms. Allocated memory is still 186.6MB. Free memory was 110.0MB in the beginning and 138.7MB in the end (delta: -28.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 19:44:02,089 INFO L158 Benchmark]: TraceAbstraction took 9342.40ms. Allocated memory was 186.6MB in the beginning and 396.4MB in the end (delta: 209.7MB). Free memory was 138.7MB in the beginning and 261.1MB in the end (delta: -122.4MB). Peak memory consumption was 206.8MB. Max. memory is 16.1GB. [2024-10-11 19:44:02,089 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 396.4MB. Free memory is still 261.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:44:02,091 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 104.9MB. Free memory was 76.8MB in the beginning and 76.6MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.91ms. Allocated memory is still 186.6MB. Free memory was 155.1MB in the beginning and 114.1MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.05ms. Allocated memory is still 186.6MB. Free memory was 114.1MB in the beginning and 112.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.52ms. Allocated memory is still 186.6MB. Free memory was 112.1MB in the beginning and 110.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 496.10ms. Allocated memory is still 186.6MB. Free memory was 110.0MB in the beginning and 138.7MB in the end (delta: -28.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9342.40ms. Allocated memory was 186.6MB in the beginning and 396.4MB in the end (delta: 209.7MB). Free memory was 138.7MB in the beginning and 261.1MB in the end (delta: -122.4MB). Peak memory consumption was 206.8MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 396.4MB. Free memory is still 261.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=0, myglobal=1, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=1, myglobal=2, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=2, myglobal=3, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=3, myglobal=4, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=4, myglobal=5, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=5, myglobal=6, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=6, myglobal=7, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=7, myglobal=8, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=8, myglobal=9, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=9, myglobal=10, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=10, myglobal=11, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=11, myglobal=12, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=12, myglobal=13, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=13, myglobal=14, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=14, myglobal=15, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=15, myglobal=16, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=16, myglobal=17, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=17, myglobal=18, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=18, myglobal=19, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=19, myglobal=20, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=20, myglobal=20, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=21, myglobal=21] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=22, myglobal=22] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=23, myglobal=23] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=24, myglobal=24] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=25, myglobal=25] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=26, myglobal=26] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=27, myglobal=27] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=28, myglobal=28] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=29, myglobal=29] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=30, myglobal=30] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=31, myglobal=31] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=32, myglobal=32] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=33, myglobal=33] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=34, myglobal=34] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=35, myglobal=35] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=36, myglobal=36] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=37, myglobal=37] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=38, myglobal=38] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=39, myglobal=39] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=40, myglobal=40] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) [L13] CALL 0 reach_error() [L12] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L12] 0 __assert_fail ("0", "pthread-demo-datarace-2.c", 25, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, j=40, myglobal=40] - UnprovableResult [Line: 1338]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1342]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 32 locations, 3 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: 9.1s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 560 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 838 IncrementalHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1 mSDtfsCounter, 838 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 881 GetRequests, 778 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1534occurred in iteration=8, InterpolantAutomatonStates: 102, 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.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1012 NumberOfCodeBlocks, 973 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1229 ConstructedInterpolants, 0 QuantifiedInterpolants, 3229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 918 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 3439/5278 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-10-11 19:44:02,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:44:04,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:44:04,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:44:04,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:44:04,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:44:04,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:44:04,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:44:04,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:44:04,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:44:04,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:44:04,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:44:04,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:44:04,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:44:04,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:44:04,581 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:44:04,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:44:04,582 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:44:04,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:44:04,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:44:04,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:44:04,583 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:44:04,586 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:44:04,587 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:44:04,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:44:04,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:44:04,587 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:44:04,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:44:04,588 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:44:04,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:44:04,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:44:04,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:44:04,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:44:04,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:44:04,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:44:04,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:44:04,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:44:04,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:44:04,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:44:04,591 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:44:04,591 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:44:04,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:44:04,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:44:04,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:44:04,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:44:04,593 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:44:04,593 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-clean/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-clean/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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2024-10-11 19:44:04,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:44:04,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:44:04,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:44:04,989 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:44:04,990 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:44:04,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-10-11 19:44:06,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:44:06,889 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:44:06,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-10-11 19:44:06,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e93b93935/588f2266a6b248749330cf245ae61801/FLAGd4793c179 [2024-10-11 19:44:06,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e93b93935/588f2266a6b248749330cf245ae61801 [2024-10-11 19:44:06,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:44:06,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:44:06,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:44:06,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:44:06,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:44:06,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:44:06" (1/1) ... [2024-10-11 19:44:06,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55072c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:06, skipping insertion in model container [2024-10-11 19:44:06,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:44:06" (1/1) ... [2024-10-11 19:44:06,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:44:07,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:44:07,588 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:44:07,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:44:07,747 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:44:07,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07 WrapperNode [2024-10-11 19:44:07,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:44:07,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:44:07,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:44:07,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:44:07,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,803 INFO L138 Inliner]: procedures = 365, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-10-11 19:44:07,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:44:07,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:44:07,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:44:07,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:44:07,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,831 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 19:44:07,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:44:07,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:44:07,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:44:07,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:44:07,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (1/1) ... [2024-10-11 19:44:07,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:44:07,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:44:07,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:44:07,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:44:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:44:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:44:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:44:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-10-11 19:44:07,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-10-11 19:44:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:44:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:44:07,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:44:07,956 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:44:08,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:44:08,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:44:08,257 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:44:08,257 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:44:08,452 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:44:08,452 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 19:44:08,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:08 BoogieIcfgContainer [2024-10-11 19:44:08,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:44:08,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:44:08,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:44:08,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:44:08,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:44:06" (1/3) ... [2024-10-11 19:44:08,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7c9ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:44:08, skipping insertion in model container [2024-10-11 19:44:08,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:07" (2/3) ... [2024-10-11 19:44:08,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7c9ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:44:08, skipping insertion in model container [2024-10-11 19:44:08,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:08" (3/3) ... [2024-10-11 19:44:08,460 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-10-11 19:44:08,476 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:44:08,477 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 19:44:08,477 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:44:08,515 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 19:44:08,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2024-10-11 19:44:08,571 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-10-11 19:44:08,571 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:44:08,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 26 events. 4/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2024-10-11 19:44:08,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2024-10-11 19:44:08,576 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2024-10-11 19:44:08,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:44:08,592 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;@1820cf43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:44:08,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 19:44:08,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:44:08,606 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2024-10-11 19:44:08,606 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:44:08,607 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:08,607 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:08,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:44:08,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash -378641850, now seen corresponding path program 1 times [2024-10-11 19:44:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:08,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365608679] [2024-10-11 19:44:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:08,631 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-10-11 19:44:08,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:08,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 19:44:08,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:08,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 19:44:08,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:08,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:08,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365608679] [2024-10-11 19:44:08,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365608679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:08,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:08,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:44:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472207602] [2024-10-11 19:44:08,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:08,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 19:44:08,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:08,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 19:44:08,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 19:44:08,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-10-11 19:44:08,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-10-11 19:44:08,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:08,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-10-11 19:44:08,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:08,854 INFO L124 PetriNetUnfolderBase]: 13/40 cut-off events. [2024-10-11 19:44:08,854 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:44:08,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 40 events. 13/40 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 83 event pairs, 6 based on Foata normal form. 3/39 useless extension candidates. Maximal degree in co-relation 56. Up to 30 conditions per place. [2024-10-11 19:44:08,857 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 12 selfloop transitions, 0 changer transitions 1/20 dead transitions. [2024-10-11 19:44:08,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 70 flow [2024-10-11 19:44:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 19:44:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 19:44:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2024-10-11 19:44:08,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-10-11 19:44:08,870 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 2 states and 35 transitions. [2024-10-11 19:44:08,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 70 flow [2024-10-11 19:44:08,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:08,876 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 40 flow [2024-10-11 19:44:08,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2024-10-11 19:44:08,883 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -4 predicate places. [2024-10-11 19:44:08,884 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 40 flow [2024-10-11 19:44:08,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-10-11 19:44:08,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:08,884 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:08,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 19:44:09,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 19:44:09,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:44:09,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:09,086 INFO L85 PathProgramCache]: Analyzing trace with hash -470810539, now seen corresponding path program 1 times [2024-10-11 19:44:09,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:09,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845536870] [2024-10-11 19:44:09,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:09,087 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-10-11 19:44:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:09,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 19:44:09,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:09,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:44:09,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:09,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:09,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:09,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845536870] [2024-10-11 19:44:09,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845536870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:09,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:09,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:44:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345183184] [2024-10-11 19:44:09,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:09,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:09,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:09,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:09,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:09,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-10-11 19:44:09,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-11 19:44:09,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:09,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-10-11 19:44:09,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:09,254 INFO L124 PetriNetUnfolderBase]: 17/55 cut-off events. [2024-10-11 19:44:09,254 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:09,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 55 events. 17/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 4 based on Foata normal form. 4/56 useless extension candidates. Maximal degree in co-relation 93. Up to 30 conditions per place. [2024-10-11 19:44:09,255 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 15 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2024-10-11 19:44:09,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 84 flow [2024-10-11 19:44:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-10-11 19:44:09,257 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-10-11 19:44:09,257 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 40 flow. Second operand 3 states and 48 transitions. [2024-10-11 19:44:09,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 84 flow [2024-10-11 19:44:09,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:44:09,261 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2024-10-11 19:44:09,261 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2024-10-11 19:44:09,262 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2024-10-11 19:44:09,262 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2024-10-11 19:44:09,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-11 19:44:09,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:09,263 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:09,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:44:09,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 19:44:09,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:44:09,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash -382590475, now seen corresponding path program 1 times [2024-10-11 19:44:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331410120] [2024-10-11 19:44:09,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:09,469 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-10-11 19:44:09,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:09,472 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 19:44:09,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:09,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:44:09,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:09,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:09,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:09,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331410120] [2024-10-11 19:44:09,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331410120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:09,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:09,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:44:09,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556180450] [2024-10-11 19:44:09,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:09,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:09,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-10-11 19:44:09,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-10-11 19:44:09,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:09,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-10-11 19:44:09,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:09,620 INFO L124 PetriNetUnfolderBase]: 25/82 cut-off events. [2024-10-11 19:44:09,621 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-11 19:44:09,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 82 events. 25/82 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 224 event pairs, 9 based on Foata normal form. 4/82 useless extension candidates. Maximal degree in co-relation 166. Up to 38 conditions per place. [2024-10-11 19:44:09,624 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 17 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2024-10-11 19:44:09,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 112 flow [2024-10-11 19:44:09,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-10-11 19:44:09,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-10-11 19:44:09,627 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 48 transitions. [2024-10-11 19:44:09,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 112 flow [2024-10-11 19:44:09,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:09,629 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 62 flow [2024-10-11 19:44:09,629 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2024-10-11 19:44:09,631 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2024-10-11 19:44:09,631 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 62 flow [2024-10-11 19:44:09,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-10-11 19:44:09,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:09,632 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-10-11 19:44:09,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:09,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 19:44:09,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:44:09,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash -85413656, now seen corresponding path program 1 times [2024-10-11 19:44:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:09,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027228607] [2024-10-11 19:44:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:09,836 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-10-11 19:44:09,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:09,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 19:44:09,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:09,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:44:09,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:09,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:44:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:09,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:09,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027228607] [2024-10-11 19:44:09,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027228607] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:44:09,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:44:09,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-11 19:44:09,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892044499] [2024-10-11 19:44:09,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:44:09,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:44:09,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:09,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:44:09,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:44:09,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:44:09,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-10-11 19:44:09,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:09,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:44:09,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:10,129 INFO L124 PetriNetUnfolderBase]: 67/175 cut-off events. [2024-10-11 19:44:10,129 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-10-11 19:44:10,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 175 events. 67/175 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 609 event pairs, 10 based on Foata normal form. 18/189 useless extension candidates. Maximal degree in co-relation 404. Up to 36 conditions per place. [2024-10-11 19:44:10,132 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 35 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2024-10-11 19:44:10,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 47 transitions, 240 flow [2024-10-11 19:44:10,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:44:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:44:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-10-11 19:44:10,134 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-10-11 19:44:10,134 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 62 flow. Second operand 6 states and 93 transitions. [2024-10-11 19:44:10,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 47 transitions, 240 flow [2024-10-11 19:44:10,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 47 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:10,136 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 100 flow [2024-10-11 19:44:10,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2024-10-11 19:44:10,137 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2024-10-11 19:44:10,137 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 100 flow [2024-10-11 19:44:10,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-10-11 19:44:10,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:10,138 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:10,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:10,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 19:44:10,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:44:10,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1664429240, now seen corresponding path program 2 times [2024-10-11 19:44:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:10,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454972071] [2024-10-11 19:44:10,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:44:10,343 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-10-11 19:44:10,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:10,344 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 19:44:10,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:10,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:44:10,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:44:10,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:44:10,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 19:44:10,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:44:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 19:44:10,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:10,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454972071] [2024-10-11 19:44:10,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454972071] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:44:10,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:44:10,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-11 19:44:10,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791392641] [2024-10-11 19:44:10,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:44:10,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 19:44:10,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:10,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 19:44:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 19:44:10,665 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:44:10,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 100 flow. Second operand has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 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-10-11 19:44:10,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:10,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:44:10,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:11,164 INFO L124 PetriNetUnfolderBase]: 139/355 cut-off events. [2024-10-11 19:44:11,165 INFO L125 PetriNetUnfolderBase]: For 567/567 co-relation queries the response was YES. [2024-10-11 19:44:11,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 355 events. 139/355 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1370 event pairs, 10 based on Foata normal form. 36/387 useless extension candidates. Maximal degree in co-relation 1053. Up to 72 conditions per place. [2024-10-11 19:44:11,172 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 71 selfloop transitions, 12 changer transitions 0/89 dead transitions. [2024-10-11 19:44:11,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 89 transitions, 542 flow [2024-10-11 19:44:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 19:44:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 19:44:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-10-11 19:44:11,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-10-11 19:44:11,175 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 100 flow. Second operand 12 states and 186 transitions. [2024-10-11 19:44:11,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 89 transitions, 542 flow [2024-10-11 19:44:11,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 89 transitions, 522 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:11,183 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 188 flow [2024-10-11 19:44:11,184 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=188, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2024-10-11 19:44:11,186 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 25 predicate places. [2024-10-11 19:44:11,186 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 188 flow [2024-10-11 19:44:11,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 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-10-11 19:44:11,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:11,187 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:11,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:11,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 19:44:11,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:44:11,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1044101128, now seen corresponding path program 3 times [2024-10-11 19:44:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774918898] [2024-10-11 19:44:11,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:44:11,389 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-10-11 19:44:11,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:11,391 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 19:44:11,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:11,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 19:44:11,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:44:11,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:44:11,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-11 19:44:11,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:44:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-11 19:44:11,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:11,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774918898] [2024-10-11 19:44:11,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774918898] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:44:11,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:44:11,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-11 19:44:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566942584] [2024-10-11 19:44:11,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:44:11,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:44:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:11,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:44:11,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:44:11,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:44:11,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-10-11 19:44:11,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:11,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:44:11,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:11,674 INFO L124 PetriNetUnfolderBase]: 184/543 cut-off events. [2024-10-11 19:44:11,675 INFO L125 PetriNetUnfolderBase]: For 2246/2266 co-relation queries the response was YES. [2024-10-11 19:44:11,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 543 events. 184/543 cut-off events. For 2246/2266 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2728 event pairs, 34 based on Foata normal form. 39/563 useless extension candidates. Maximal degree in co-relation 1828. Up to 165 conditions per place. [2024-10-11 19:44:11,683 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 74 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2024-10-11 19:44:11,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 866 flow [2024-10-11 19:44:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:44:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:44:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2024-10-11 19:44:11,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2024-10-11 19:44:11,685 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 188 flow. Second operand 6 states and 92 transitions. [2024-10-11 19:44:11,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 866 flow [2024-10-11 19:44:11,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 836 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:44:11,694 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 222 flow [2024-10-11 19:44:11,695 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2024-10-11 19:44:11,696 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 31 predicate places. [2024-10-11 19:44:11,697 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 222 flow [2024-10-11 19:44:11,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-10-11 19:44:11,697 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:11,697 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:11,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:11,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-11 19:44:11,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:44:11,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash 810261457, now seen corresponding path program 4 times [2024-10-11 19:44:11,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:11,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078429885] [2024-10-11 19:44:11,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:44:11,899 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-10-11 19:44:11,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:11,902 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-10-11 19:44:11,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:11,981 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:44:11,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:44:11,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:44:11,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 28 proven. 59 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-11 19:44:12,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:44:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 28 proven. 59 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-11 19:44:12,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:12,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078429885] [2024-10-11 19:44:12,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078429885] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:44:12,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:44:12,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-11 19:44:12,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575588441] [2024-10-11 19:44:12,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:44:12,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 19:44:12,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:12,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 19:44:12,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 19:44:12,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:44:12,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 34 transitions, 222 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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-10-11 19:44:12,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:12,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:44:12,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:12,760 INFO L124 PetriNetUnfolderBase]: 398/1113 cut-off events. [2024-10-11 19:44:12,761 INFO L125 PetriNetUnfolderBase]: For 5570/5630 co-relation queries the response was YES. [2024-10-11 19:44:12,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 1113 events. 398/1113 cut-off events. For 5570/5630 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6577 event pairs, 24 based on Foata normal form. 78/1181 useless extension candidates. Maximal degree in co-relation 4223. Up to 363 conditions per place. [2024-10-11 19:44:12,773 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 158 selfloop transitions, 12 changer transitions 0/178 dead transitions. [2024-10-11 19:44:12,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 178 transitions, 1856 flow [2024-10-11 19:44:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 19:44:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 19:44:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-10-11 19:44:12,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876 [2024-10-11 19:44:12,776 INFO L175 Difference]: Start difference. First operand has 56 places, 34 transitions, 222 flow. Second operand 12 states and 185 transitions. [2024-10-11 19:44:12,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 178 transitions, 1856 flow [2024-10-11 19:44:12,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 178 transitions, 1836 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:12,785 INFO L231 Difference]: Finished difference. Result has 73 places, 41 transitions, 310 flow [2024-10-11 19:44:12,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=310, PETRI_PLACES=73, PETRI_TRANSITIONS=41} [2024-10-11 19:44:12,786 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 48 predicate places. [2024-10-11 19:44:12,786 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 41 transitions, 310 flow [2024-10-11 19:44:12,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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-10-11 19:44:12,787 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:12,787 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:12,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 19:44:12,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-10-11 19:44:12,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:44:12,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash 401434037, now seen corresponding path program 5 times [2024-10-11 19:44:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:12,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620219548] [2024-10-11 19:44:12,989 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:44:12,989 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-10-11 19:44:12,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:12,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-11 19:44:12,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Waiting until timeout for monitored process [2024-10-11 19:44:13,131 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-10-11 19:44:13,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:44:13,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:44:13,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-11 19:44:13,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:44:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-11 19:44:13,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620219548] [2024-10-11 19:44:13,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620219548] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:44:13,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:44:13,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-11 19:44:13,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677605492] [2024-10-11 19:44:13,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:44:13,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 19:44:13,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:13,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 19:44:13,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2024-10-11 19:44:13,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:44:13,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 41 transitions, 310 flow. Second operand has 24 states, 24 states have (on average 11.333333333333334) internal successors, (272), 24 states have internal predecessors, (272), 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-10-11 19:44:13,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:13,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:44:13,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:15,221 INFO L124 PetriNetUnfolderBase]: 950/2480 cut-off events. [2024-10-11 19:44:15,221 INFO L125 PetriNetUnfolderBase]: For 18087/18087 co-relation queries the response was YES. [2024-10-11 19:44:15,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10193 conditions, 2480 events. 950/2480 cut-off events. For 18087/18087 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 16439 event pairs, 34 based on Foata normal form. 230/2681 useless extension candidates. Maximal degree in co-relation 10166. Up to 506 conditions per place. [2024-10-11 19:44:15,273 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 299 selfloop transitions, 22 changer transitions 0/329 dead transitions. [2024-10-11 19:44:15,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 329 transitions, 3724 flow [2024-10-11 19:44:15,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 19:44:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 19:44:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 340 transitions. [2024-10-11 19:44:15,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5723905723905723 [2024-10-11 19:44:15,276 INFO L175 Difference]: Start difference. First operand has 73 places, 41 transitions, 310 flow. Second operand 22 states and 340 transitions. [2024-10-11 19:44:15,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 329 transitions, 3724 flow [2024-10-11 19:44:15,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 329 transitions, 3598 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:44:15,296 INFO L231 Difference]: Finished difference. Result has 102 places, 52 transitions, 504 flow [2024-10-11 19:44:15,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=504, PETRI_PLACES=102, PETRI_TRANSITIONS=52} [2024-10-11 19:44:15,297 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 77 predicate places. [2024-10-11 19:44:15,297 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 52 transitions, 504 flow [2024-10-11 19:44:15,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.333333333333334) internal successors, (272), 24 states have internal predecessors, (272), 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-10-11 19:44:15,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:15,298 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:15,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (9)] Forceful destruction successful, exit code 0 [2024-10-11 19:44:15,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-11 19:44:15,503 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:44:15,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash -368439557, now seen corresponding path program 6 times [2024-10-11 19:44:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:15,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287263842] [2024-10-11 19:44:15,504 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 19:44:15,504 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-10-11 19:44:15,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:15,508 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-11 19:44:15,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (10)] Waiting until timeout for monitored process [2024-10-11 19:44:15,695 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-10-11 19:44:15,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:44:15,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:44:15,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-11 19:44:15,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:44:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-11 19:44:16,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:16,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287263842] [2024-10-11 19:44:16,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287263842] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:44:16,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:44:16,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-11 19:44:16,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761537030] [2024-10-11 19:44:16,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:44:16,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 19:44:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 19:44:16,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2024-10-11 19:44:16,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-11 19:44:16,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 52 transitions, 504 flow. Second operand has 24 states, 24 states have (on average 12.083333333333334) internal successors, (290), 24 states have internal predecessors, (290), 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-10-11 19:44:16,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:16,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-11 19:44:16,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:18,178 INFO L124 PetriNetUnfolderBase]: 1390/3879 cut-off events. [2024-10-11 19:44:18,178 INFO L125 PetriNetUnfolderBase]: For 47299/47473 co-relation queries the response was YES. [2024-10-11 19:44:18,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18636 conditions, 3879 events. 1390/3879 cut-off events. For 47299/47473 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27888 event pairs, 64 based on Foata normal form. 230/4070 useless extension candidates. Maximal degree in co-relation 18598. Up to 1323 conditions per place. [2024-10-11 19:44:18,216 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 508 selfloop transitions, 22 changer transitions 0/539 dead transitions. [2024-10-11 19:44:18,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 539 transitions, 7894 flow [2024-10-11 19:44:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 19:44:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 19:44:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 339 transitions. [2024-10-11 19:44:18,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-10-11 19:44:18,219 INFO L175 Difference]: Start difference. First operand has 102 places, 52 transitions, 504 flow. Second operand 22 states and 339 transitions. [2024-10-11 19:44:18,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 539 transitions, 7894 flow [2024-10-11 19:44:18,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 539 transitions, 7516 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-10-11 19:44:18,262 INFO L231 Difference]: Finished difference. Result has 125 places, 63 transitions, 686 flow [2024-10-11 19:44:18,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=686, PETRI_PLACES=125, PETRI_TRANSITIONS=63} [2024-10-11 19:44:18,263 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 100 predicate places. [2024-10-11 19:44:18,263 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 63 transitions, 686 flow [2024-10-11 19:44:18,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.083333333333334) internal successors, (290), 24 states have internal predecessors, (290), 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-10-11 19:44:18,264 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:18,264 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:18,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (10)] Ended with exit code 0 [2024-10-11 19:44:18,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-11 19:44:18,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-11 19:44:18,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:18,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1980696427, now seen corresponding path program 7 times [2024-10-11 19:44:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:18,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254976591] [2024-10-11 19:44:18,470 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 19:44:18,470 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-10-11 19:44:18,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:18,473 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-11 19:44:18,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (11)] Waiting until timeout for monitored process [2024-10-11 19:44:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:44:18,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:44:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:44:18,973 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 19:44:18,973 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:44:18,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2024-10-11 19:44:18,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2024-10-11 19:44:18,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-11 19:44:18,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (11)] Ended with exit code 0 [2024-10-11 19:44:19,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-10-11 19:44:19,177 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-10-11 19:44:19,345 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:44:19,345 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:44:19,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:44:19 BasicIcfg [2024-10-11 19:44:19,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:44:19,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:44:19,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:44:19,350 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:44:19,351 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:08" (3/4) ... [2024-10-11 19:44:19,353 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:44:19,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:44:19,355 INFO L158 Benchmark]: Toolchain (without parser) took 12416.37ms. Allocated memory was 60.8MB in the beginning and 343.9MB in the end (delta: 283.1MB). Free memory was 35.4MB in the beginning and 235.0MB in the end (delta: -199.7MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2024-10-11 19:44:19,356 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory was 37.4MB in the beginning and 37.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:44:19,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 807.80ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 35.2MB in the beginning and 55.0MB in the end (delta: -19.8MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-10-11 19:44:19,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.03ms. Allocated memory is still 81.8MB. Free memory was 55.0MB in the beginning and 52.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:44:19,357 INFO L158 Benchmark]: Boogie Preprocessor took 52.89ms. Allocated memory is still 81.8MB. Free memory was 52.5MB in the beginning and 50.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:44:19,360 INFO L158 Benchmark]: RCFGBuilder took 593.02ms. Allocated memory is still 81.8MB. Free memory was 50.0MB in the beginning and 46.2MB in the end (delta: 3.8MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-11 19:44:19,361 INFO L158 Benchmark]: TraceAbstraction took 10894.93ms. Allocated memory was 81.8MB in the beginning and 343.9MB in the end (delta: 262.1MB). Free memory was 45.5MB in the beginning and 235.0MB in the end (delta: -189.6MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. [2024-10-11 19:44:19,361 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 343.9MB. Free memory is still 235.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:44:19,363 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.14ms. Allocated memory is still 60.8MB. Free memory was 37.4MB in the beginning and 37.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 807.80ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 35.2MB in the beginning and 55.0MB in the end (delta: -19.8MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.03ms. Allocated memory is still 81.8MB. Free memory was 55.0MB in the beginning and 52.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.89ms. Allocated memory is still 81.8MB. Free memory was 52.5MB in the beginning and 50.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 593.02ms. Allocated memory is still 81.8MB. Free memory was 50.0MB in the beginning and 46.2MB in the end (delta: 3.8MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10894.93ms. Allocated memory was 81.8MB in the beginning and 343.9MB in the end (delta: 262.1MB). Free memory was 45.5MB in the beginning and 235.0MB in the end (delta: -189.6MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 343.9MB. Free memory is still 235.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=0] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=0] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=0, myglobal=0, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=0, myglobal=1, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=1, myglobal=1, mythread=0] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=1] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=1, myglobal=1] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=2, myglobal=2] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=3, myglobal=3] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=4, myglobal=4] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=5, myglobal=5] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=6, myglobal=6] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=7, myglobal=7] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=8, myglobal=8] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=9, myglobal=9] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=10, myglobal=10] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=11, myglobal=11] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=11, myglobal=11] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=11, myglobal=11] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=11, myglobal=11] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=12, myglobal=12] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=12, myglobal=12] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=12, myglobal=12] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=12, myglobal=12] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=13, myglobal=13] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=13, myglobal=13] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=13, myglobal=13] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=13, myglobal=13] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=14, myglobal=14] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=14, myglobal=14] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=14, myglobal=14] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=14, myglobal=14] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=15, myglobal=15] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=15, myglobal=15] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=15, myglobal=15] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=15, myglobal=15] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=16, myglobal=16] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=16, myglobal=16] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=16, myglobal=16] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=16, myglobal=16] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=17, myglobal=17] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=17, myglobal=17] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=17, myglobal=17] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=17, myglobal=17] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=18, myglobal=18] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=18, myglobal=18] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=18, myglobal=18] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=18, myglobal=18] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=19, myglobal=19] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=19, myglobal=19] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=19, myglobal=19] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=19, myglobal=19] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=20, myglobal=20] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=20, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=20, myglobal=20] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=21, myglobal=21] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=21, myglobal=21] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=20, j=21, myglobal=21, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=20, j=21, myglobal=22, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=21, myglobal=22, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=21, myglobal=22, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=21, myglobal=23, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=21, myglobal=23, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=21, myglobal=23, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=21, myglobal=24, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=21, myglobal=24, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=21, myglobal=24, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=21, myglobal=25, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=21, myglobal=25, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=21, myglobal=25, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=21, myglobal=26, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=21, myglobal=26, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=21, myglobal=26, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=21, myglobal=27, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=21, myglobal=27, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=21, myglobal=27, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=21, myglobal=28, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=21, myglobal=28, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=21, myglobal=28, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=21, myglobal=29, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=21, myglobal=29, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=21, myglobal=29, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=21, myglobal=30, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=21, myglobal=30, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=21, myglobal=30, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=21, myglobal=31, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=21, myglobal=31, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=21, myglobal=31, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=21, myglobal=32, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=21, myglobal=32, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=21, myglobal=32, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=21, myglobal=33, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=21, myglobal=33, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=21, myglobal=33, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=21, myglobal=34, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=21, myglobal=34, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=21, myglobal=34, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=21, myglobal=35, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=21, myglobal=35, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=21, myglobal=35, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=21, myglobal=36, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=21, myglobal=36, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=21, myglobal=36, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=21, myglobal=37, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=21, myglobal=37, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=21, myglobal=37, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=21, myglobal=38, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=21, myglobal=38, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=21, myglobal=38, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=21, myglobal=39, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=21, myglobal=39, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=21, myglobal=39, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=21, myglobal=40, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=21, myglobal=40, mythread=0] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=21, myglobal=40, mythread=0] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=21, myglobal=40, mythread=0] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) [L13] CALL 0 reach_error() [L12] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, j=21, myglobal=40] [L12] 0 __assert_fail ("0", "pthread-demo-datarace-2.c", 25, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, j=21, myglobal=40] - UnprovableResult [Line: 1338]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1342]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 32 locations, 3 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: 10.6s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 887 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 879 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2544 IncrementalHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 2 mSDtfsCounter, 2544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 785 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=9, InterpolantAutomatonStates: 88, 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.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 573 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 2219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 657 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 2185/3111 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-10-11 19:44:19,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample