./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-atomic/lamport.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:20:59,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:21:00,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:21:00,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:21:00,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:21:00,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:21:00,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:21:00,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:21:00,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:21:00,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:21:00,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:21:00,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:21:00,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:21:00,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:21:00,089 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:21:00,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:21:00,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:21:00,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:21:00,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:21:00,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:21:00,095 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:21:00,096 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:21:00,096 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:21:00,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:21:00,096 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:21:00,097 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:21:00,097 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:21:00,097 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:21:00,097 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:21:00,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:21:00,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:21:00,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:21:00,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:21:00,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:21:00,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:21:00,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:21:00,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:21:00,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:21:00,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:21:00,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:21:00,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:21:00,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:21:00,102 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c [2024-11-19 09:21:00,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:21:00,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:21:00,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:21:00,411 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:21:00,412 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:21:00,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport.i [2024-11-19 09:21:02,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:21:02,331 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:21:02,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2024-11-19 09:21:02,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada6ce504/50c00635a19f4f39a92d3bb1185f29a5/FLAG4b64e19d1 [2024-11-19 09:21:02,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada6ce504/50c00635a19f4f39a92d3bb1185f29a5 [2024-11-19 09:21:02,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:21:02,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:21:02,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:21:02,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:21:02,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:21:02,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:02,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30aa0277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02, skipping insertion in model container [2024-11-19 09:21:02,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:02,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:21:02,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:21:02,814 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:21:02,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:21:02,897 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:21:02,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02 WrapperNode [2024-11-19 09:21:02,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:21:02,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:21:02,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:21:02,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:21:02,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:02,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:02,956 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-11-19 09:21:02,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:21:02,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:21:02,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:21:02,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:21:02,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:02,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:02,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:03,008 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-11-19 09:21:03,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:03,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:03,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:03,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:03,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:03,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:03,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:21:03,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:21:03,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:21:03,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:21:03,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (1/1) ... [2024-11-19 09:21:03,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:21:03,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:21:03,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:21:03,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:21:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-19 09:21:03,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-19 09:21:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-19 09:21:03,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-19 09:21:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:21:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:21:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:21:03,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:21:03,176 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:21:03,298 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:21:03,300 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:21:03,481 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:21:03,481 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:21:03,545 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:21:03,545 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-19 09:21:03,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:21:03 BoogieIcfgContainer [2024-11-19 09:21:03,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:21:03,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:21:03,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:21:03,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:21:03,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:21:02" (1/3) ... [2024-11-19 09:21:03,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2db971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:21:03, skipping insertion in model container [2024-11-19 09:21:03,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:21:02" (2/3) ... [2024-11-19 09:21:03,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2db971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:21:03, skipping insertion in model container [2024-11-19 09:21:03,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:21:03" (3/3) ... [2024-11-19 09:21:03,553 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2024-11-19 09:21:03,565 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:21:03,566 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 09:21:03,566 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:21:03,616 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:21:03,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 78 transitions, 170 flow [2024-11-19 09:21:03,687 INFO L124 PetriNetUnfolderBase]: 20/76 cut-off events. [2024-11-19 09:21:03,687 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:21:03,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 76 events. 20/76 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 193 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 71. Up to 4 conditions per place. [2024-11-19 09:21:03,693 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 78 transitions, 170 flow [2024-11-19 09:21:03,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 75 transitions, 162 flow [2024-11-19 09:21:03,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:21:03,712 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;@26411c06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:21:03,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 09:21:03,720 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:21:03,721 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-19 09:21:03,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:21:03,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:03,722 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:03,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:21:03,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:03,728 INFO L85 PathProgramCache]: Analyzing trace with hash -466669316, now seen corresponding path program 1 times [2024-11-19 09:21:03,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:21:03,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978314223] [2024-11-19 09:21:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:21:03,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:21:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:21:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:03,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:21:03,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978314223] [2024-11-19 09:21:03,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978314223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:21:03,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:21:03,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:21:03,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264755420] [2024-11-19 09:21:03,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:21:03,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 09:21:03,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:21:03,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 09:21:03,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 09:21:03,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 78 [2024-11-19 09:21:03,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 75 transitions, 162 flow. Second operand has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:03,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:03,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 78 [2024-11-19 09:21:03,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:04,128 INFO L124 PetriNetUnfolderBase]: 186/447 cut-off events. [2024-11-19 09:21:04,129 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 09:21:04,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 447 events. 186/447 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2262 event pairs, 58 based on Foata normal form. 84/443 useless extension candidates. Maximal degree in co-relation 632. Up to 212 conditions per place. [2024-11-19 09:21:04,139 INFO L140 encePairwiseOnDemand]: 70/78 looper letters, 17 selfloop transitions, 0 changer transitions 0/65 dead transitions. [2024-11-19 09:21:04,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 176 flow [2024-11-19 09:21:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 09:21:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-19 09:21:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 129 transitions. [2024-11-19 09:21:04,154 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2024-11-19 09:21:04,156 INFO L175 Difference]: Start difference. First operand has 62 places, 75 transitions, 162 flow. Second operand 2 states and 129 transitions. [2024-11-19 09:21:04,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 176 flow [2024-11-19 09:21:04,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:21:04,163 INFO L231 Difference]: Finished difference. Result has 57 places, 65 transitions, 134 flow [2024-11-19 09:21:04,167 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=57, PETRI_TRANSITIONS=65} [2024-11-19 09:21:04,170 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2024-11-19 09:21:04,170 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 65 transitions, 134 flow [2024-11-19 09:21:04,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:04,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:04,171 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:04,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:21:04,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:21:04,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:04,173 INFO L85 PathProgramCache]: Analyzing trace with hash -694881973, now seen corresponding path program 1 times [2024-11-19 09:21:04,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:21:04,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724399471] [2024-11-19 09:21:04,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:21:04,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:21:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:21:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:04,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:21:04,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724399471] [2024-11-19 09:21:04,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724399471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:21:04,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:21:04,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:21:04,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997298237] [2024-11-19 09:21:04,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:21:04,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:21:04,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:21:04,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:21:04,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:21:04,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 78 [2024-11-19 09:21:04,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 65 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:04,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:04,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 78 [2024-11-19 09:21:04,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:04,409 INFO L124 PetriNetUnfolderBase]: 234/563 cut-off events. [2024-11-19 09:21:04,409 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-19 09:21:04,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 563 events. 234/563 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3167 event pairs, 44 based on Foata normal form. 15/484 useless extension candidates. Maximal degree in co-relation 879. Up to 169 conditions per place. [2024-11-19 09:21:04,417 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 27 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2024-11-19 09:21:04,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 216 flow [2024-11-19 09:21:04,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:21:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:21:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2024-11-19 09:21:04,420 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7649572649572649 [2024-11-19 09:21:04,420 INFO L175 Difference]: Start difference. First operand has 57 places, 65 transitions, 134 flow. Second operand 3 states and 179 transitions. [2024-11-19 09:21:04,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 216 flow [2024-11-19 09:21:04,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:21:04,425 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 154 flow [2024-11-19 09:21:04,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2024-11-19 09:21:04,428 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-11-19 09:21:04,428 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 154 flow [2024-11-19 09:21:04,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:04,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:04,428 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:04,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:21:04,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:21:04,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:04,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1579381939, now seen corresponding path program 1 times [2024-11-19 09:21:04,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:21:04,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841984037] [2024-11-19 09:21:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:21:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:21:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:21:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:04,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:21:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841984037] [2024-11-19 09:21:04,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841984037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:21:04,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:21:04,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:21:04,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440923431] [2024-11-19 09:21:04,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:21:04,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:21:04,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:21:04,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:21:04,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:21:04,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 78 [2024-11-19 09:21:04,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:04,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:04,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 78 [2024-11-19 09:21:04,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:04,621 INFO L124 PetriNetUnfolderBase]: 217/546 cut-off events. [2024-11-19 09:21:04,621 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-11-19 09:21:04,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 546 events. 217/546 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3034 event pairs, 61 based on Foata normal form. 19/475 useless extension candidates. Maximal degree in co-relation 949. Up to 208 conditions per place. [2024-11-19 09:21:04,626 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 27 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2024-11-19 09:21:04,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 230 flow [2024-11-19 09:21:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:21:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:21:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2024-11-19 09:21:04,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7606837606837606 [2024-11-19 09:21:04,631 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 154 flow. Second operand 3 states and 178 transitions. [2024-11-19 09:21:04,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 230 flow [2024-11-19 09:21:04,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:21:04,634 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 158 flow [2024-11-19 09:21:04,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2024-11-19 09:21:04,635 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2024-11-19 09:21:04,635 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 158 flow [2024-11-19 09:21:04,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:04,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:04,636 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:04,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:21:04,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:21:04,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:04,639 INFO L85 PathProgramCache]: Analyzing trace with hash -264967604, now seen corresponding path program 1 times [2024-11-19 09:21:04,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:21:04,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030121904] [2024-11-19 09:21:04,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:21:04,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:21:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:21:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:04,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:21:04,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030121904] [2024-11-19 09:21:04,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030121904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:21:04,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:21:04,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:21:04,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842557921] [2024-11-19 09:21:04,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:21:04,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:21:04,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:21:04,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:21:04,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:21:04,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 78 [2024-11-19 09:21:04,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:04,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:04,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 78 [2024-11-19 09:21:04,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:04,925 INFO L124 PetriNetUnfolderBase]: 431/985 cut-off events. [2024-11-19 09:21:04,925 INFO L125 PetriNetUnfolderBase]: For 112/116 co-relation queries the response was YES. [2024-11-19 09:21:04,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 985 events. 431/985 cut-off events. For 112/116 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6042 event pairs, 150 based on Foata normal form. 19/929 useless extension candidates. Maximal degree in co-relation 1738. Up to 471 conditions per place. [2024-11-19 09:21:04,933 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 33 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-11-19 09:21:04,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 263 flow [2024-11-19 09:21:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:21:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:21:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2024-11-19 09:21:04,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7350427350427351 [2024-11-19 09:21:04,936 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 158 flow. Second operand 3 states and 172 transitions. [2024-11-19 09:21:04,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 263 flow [2024-11-19 09:21:04,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:21:04,939 INFO L231 Difference]: Finished difference. Result has 65 places, 70 transitions, 202 flow [2024-11-19 09:21:04,941 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=65, PETRI_TRANSITIONS=70} [2024-11-19 09:21:04,941 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2024-11-19 09:21:04,942 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 70 transitions, 202 flow [2024-11-19 09:21:04,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:04,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:04,943 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:04,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:21:04,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:21:04,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:04,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1922975346, now seen corresponding path program 2 times [2024-11-19 09:21:04,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:21:04,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095732248] [2024-11-19 09:21:04,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:21:04,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:21:04,971 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:21:04,972 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:21:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:05,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:21:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095732248] [2024-11-19 09:21:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095732248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:21:05,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:21:05,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:21:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927936420] [2024-11-19 09:21:05,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:21:05,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:21:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:21:05,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:21:05,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:21:05,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 78 [2024-11-19 09:21:05,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 70 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:05,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:05,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 78 [2024-11-19 09:21:05,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:05,222 INFO L124 PetriNetUnfolderBase]: 589/1499 cut-off events. [2024-11-19 09:21:05,223 INFO L125 PetriNetUnfolderBase]: For 224/256 co-relation queries the response was YES. [2024-11-19 09:21:05,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2834 conditions, 1499 events. 589/1499 cut-off events. For 224/256 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10996 event pairs, 165 based on Foata normal form. 35/1366 useless extension candidates. Maximal degree in co-relation 2827. Up to 391 conditions per place. [2024-11-19 09:21:05,232 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 33 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2024-11-19 09:21:05,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 310 flow [2024-11-19 09:21:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:21:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:21:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2024-11-19 09:21:05,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7649572649572649 [2024-11-19 09:21:05,233 INFO L175 Difference]: Start difference. First operand has 65 places, 70 transitions, 202 flow. Second operand 3 states and 179 transitions. [2024-11-19 09:21:05,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 310 flow [2024-11-19 09:21:05,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:21:05,238 INFO L231 Difference]: Finished difference. Result has 67 places, 73 transitions, 220 flow [2024-11-19 09:21:05,238 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2024-11-19 09:21:05,240 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-11-19 09:21:05,241 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 220 flow [2024-11-19 09:21:05,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:05,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:05,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:05,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:21:05,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:21:05,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:05,245 INFO L85 PathProgramCache]: Analyzing trace with hash -921894616, now seen corresponding path program 3 times [2024-11-19 09:21:05,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:21:05,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138915885] [2024-11-19 09:21:05,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:21:05,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:21:05,255 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:21:05,255 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:21:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:21:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138915885] [2024-11-19 09:21:05,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138915885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:21:05,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:21:05,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:21:05,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378482745] [2024-11-19 09:21:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:21:05,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:21:05,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:21:05,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:21:05,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:21:05,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 78 [2024-11-19 09:21:05,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:05,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:05,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 78 [2024-11-19 09:21:05,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:05,477 INFO L124 PetriNetUnfolderBase]: 648/1653 cut-off events. [2024-11-19 09:21:05,477 INFO L125 PetriNetUnfolderBase]: For 418/492 co-relation queries the response was YES. [2024-11-19 09:21:05,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3460 conditions, 1653 events. 648/1653 cut-off events. For 418/492 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12187 event pairs, 265 based on Foata normal form. 81/1656 useless extension candidates. Maximal degree in co-relation 3452. Up to 774 conditions per place. [2024-11-19 09:21:05,493 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 35 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2024-11-19 09:21:05,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 337 flow [2024-11-19 09:21:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:21:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:21:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2024-11-19 09:21:05,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2024-11-19 09:21:05,495 INFO L175 Difference]: Start difference. First operand has 67 places, 73 transitions, 220 flow. Second operand 3 states and 171 transitions. [2024-11-19 09:21:05,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 337 flow [2024-11-19 09:21:05,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:21:05,500 INFO L231 Difference]: Finished difference. Result has 69 places, 77 transitions, 272 flow [2024-11-19 09:21:05,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=69, PETRI_TRANSITIONS=77} [2024-11-19 09:21:05,504 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2024-11-19 09:21:05,504 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 77 transitions, 272 flow [2024-11-19 09:21:05,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:05,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:05,504 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:05,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:21:05,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:21:05,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:05,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1986973752, now seen corresponding path program 4 times [2024-11-19 09:21:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:21:05,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775728889] [2024-11-19 09:21:05,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:21:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:21:05,517 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:21:05,518 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:21:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:05,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:21:05,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775728889] [2024-11-19 09:21:05,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775728889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:21:05,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:21:05,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:21:05,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277196660] [2024-11-19 09:21:05,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:21:05,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:21:05,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:21:05,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:21:05,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:21:05,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 78 [2024-11-19 09:21:05,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 77 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:05,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:05,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 78 [2024-11-19 09:21:05,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:05,727 INFO L124 PetriNetUnfolderBase]: 430/1303 cut-off events. [2024-11-19 09:21:05,728 INFO L125 PetriNetUnfolderBase]: For 506/599 co-relation queries the response was YES. [2024-11-19 09:21:05,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2765 conditions, 1303 events. 430/1303 cut-off events. For 506/599 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10007 event pairs, 144 based on Foata normal form. 50/1242 useless extension candidates. Maximal degree in co-relation 2756. Up to 325 conditions per place. [2024-11-19 09:21:05,736 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 31 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2024-11-19 09:21:05,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 370 flow [2024-11-19 09:21:05,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:21:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:21:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2024-11-19 09:21:05,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7649572649572649 [2024-11-19 09:21:05,738 INFO L175 Difference]: Start difference. First operand has 69 places, 77 transitions, 272 flow. Second operand 3 states and 179 transitions. [2024-11-19 09:21:05,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 370 flow [2024-11-19 09:21:05,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 87 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:21:05,743 INFO L231 Difference]: Finished difference. Result has 69 places, 76 transitions, 262 flow [2024-11-19 09:21:05,743 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=69, PETRI_TRANSITIONS=76} [2024-11-19 09:21:05,745 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2024-11-19 09:21:05,745 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 76 transitions, 262 flow [2024-11-19 09:21:05,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:05,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:05,745 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:05,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:21:05,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:21:05,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash 787722240, now seen corresponding path program 1 times [2024-11-19 09:21:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:21:05,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022223451] [2024-11-19 09:21:05,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:21:05,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:21:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:21:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:05,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:21:05,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022223451] [2024-11-19 09:21:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022223451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:21:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:21:05,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:21:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252831878] [2024-11-19 09:21:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:21:05,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:21:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:21:05,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:21:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:21:05,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 78 [2024-11-19 09:21:05,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 76 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:05,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:05,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 78 [2024-11-19 09:21:05,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:05,942 INFO L124 PetriNetUnfolderBase]: 470/1336 cut-off events. [2024-11-19 09:21:05,942 INFO L125 PetriNetUnfolderBase]: For 268/322 co-relation queries the response was YES. [2024-11-19 09:21:05,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 1336 events. 470/1336 cut-off events. For 268/322 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9947 event pairs, 168 based on Foata normal form. 39/1279 useless extension candidates. Maximal degree in co-relation 2710. Up to 493 conditions per place. [2024-11-19 09:21:05,952 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 22 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2024-11-19 09:21:05,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 327 flow [2024-11-19 09:21:05,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:21:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:21:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2024-11-19 09:21:05,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2024-11-19 09:21:05,954 INFO L175 Difference]: Start difference. First operand has 69 places, 76 transitions, 262 flow. Second operand 3 states and 171 transitions. [2024-11-19 09:21:05,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 327 flow [2024-11-19 09:21:05,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 81 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:21:05,958 INFO L231 Difference]: Finished difference. Result has 71 places, 77 transitions, 277 flow [2024-11-19 09:21:05,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=277, PETRI_PLACES=71, PETRI_TRANSITIONS=77} [2024-11-19 09:21:05,959 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2024-11-19 09:21:05,960 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 77 transitions, 277 flow [2024-11-19 09:21:05,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:05,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:05,961 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:05,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:21:05,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:21:05,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1355888439, now seen corresponding path program 1 times [2024-11-19 09:21:05,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:21:05,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280851558] [2024-11-19 09:21:05,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:21:05,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:21:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:21:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:06,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:21:06,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280851558] [2024-11-19 09:21:06,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280851558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:21:06,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:21:06,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:21:06,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133543346] [2024-11-19 09:21:06,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:21:06,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:21:06,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:21:06,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:21:06,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:21:06,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 78 [2024-11-19 09:21:06,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 77 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:06,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:06,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 78 [2024-11-19 09:21:06,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:06,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([355] L783-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr2Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_1|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_#res#1.base][50], [Black: 99#(= ~b2~0 1), 77#(= ~X~0 1), 3#L790true, 41#thr2EXITtrue, Black: 72#(= ~X~0 0), 97#true, 57#L740-1true, Black: 81#(= ~y~0 1), 101#true, Black: 86#(= 2 ~x~0), 96#(<= ~x~0 1), Black: 91#(= 2 ~y~0), 68#true]) [2024-11-19 09:21:06,150 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 09:21:06,150 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:21:06,150 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:21:06,150 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:21:06,158 INFO L124 PetriNetUnfolderBase]: 431/1290 cut-off events. [2024-11-19 09:21:06,159 INFO L125 PetriNetUnfolderBase]: For 245/286 co-relation queries the response was YES. [2024-11-19 09:21:06,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 1290 events. 431/1290 cut-off events. For 245/286 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 9221 event pairs, 178 based on Foata normal form. 23/1241 useless extension candidates. Maximal degree in co-relation 2747. Up to 497 conditions per place. [2024-11-19 09:21:06,167 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 21 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2024-11-19 09:21:06,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 314 flow [2024-11-19 09:21:06,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:21:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:21:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2024-11-19 09:21:06,168 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7264957264957265 [2024-11-19 09:21:06,168 INFO L175 Difference]: Start difference. First operand has 71 places, 77 transitions, 277 flow. Second operand 3 states and 170 transitions. [2024-11-19 09:21:06,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 314 flow [2024-11-19 09:21:06,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 304 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-19 09:21:06,173 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 257 flow [2024-11-19 09:21:06,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2024-11-19 09:21:06,174 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-11-19 09:21:06,174 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 257 flow [2024-11-19 09:21:06,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:06,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:06,175 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:06,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:21:06,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:21:06,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash -199245501, now seen corresponding path program 1 times [2024-11-19 09:21:06,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:21:06,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392184672] [2024-11-19 09:21:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:21:06,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:21:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:21:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:06,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:21:06,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392184672] [2024-11-19 09:21:06,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392184672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:21:06,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:21:06,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:21:06,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162881215] [2024-11-19 09:21:06,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:21:06,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:21:06,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:21:06,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:21:06,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:21:06,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 78 [2024-11-19 09:21:06,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:06,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:06,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 78 [2024-11-19 09:21:06,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:06,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([397] L746-1-->L746-2: Formula: (< v_~b2~0_In_1 1) InVars {~b2~0=v_~b2~0_In_1} OutVars{~b2~0=v_~b2~0_In_1} AuxVars[] AssignedVars[][34], [Black: 99#(= ~b2~0 1), 77#(= ~X~0 1), 3#L790true, 107#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 103#(= ~b1~0 1), Black: 72#(= ~X~0 0), 10#L746-2true, Black: 79#true, 101#true, Black: 86#(= 2 ~x~0), 96#(<= ~x~0 1), 19#L783true, Black: 91#(= 2 ~y~0), 68#true]) [2024-11-19 09:21:06,328 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:21:06,328 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:21:06,328 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:21:06,328 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:21:06,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([355] L783-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr2Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_1|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_#res#1.base][46], [Black: 99#(= ~b2~0 1), 77#(= ~X~0 1), Black: 103#(= ~b1~0 1), 41#thr2EXITtrue, 107#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 3#L790true, Black: 72#(= ~X~0 0), Black: 81#(= ~y~0 1), 101#true, Black: 86#(= 2 ~x~0), 96#(<= ~x~0 1), 22#L748-3true, Black: 91#(= 2 ~y~0), 68#true]) [2024-11-19 09:21:06,332 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:21:06,332 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:21:06,332 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:21:06,333 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:21:06,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L757-->thr1EXIT: Formula: (and (= 0 |v_thr1Thread1of1ForFork1_#res#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_1|, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_#res#1.base][44], [Black: 99#(= ~b2~0 1), 107#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 41#thr2EXITtrue, Black: 103#(= ~b1~0 1), 6#thr1EXITtrue, Black: 70#true, 5#L789-4true, Black: 81#(= ~y~0 1), 101#true, Black: 86#(= 2 ~x~0), 96#(<= ~x~0 1), Black: 91#(= 2 ~y~0), 68#true]) [2024-11-19 09:21:06,334 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:21:06,334 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:21:06,334 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:21:06,334 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:21:06,335 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([397] L746-1-->L746-2: Formula: (< v_~b2~0_In_1 1) InVars {~b2~0=v_~b2~0_In_1} OutVars{~b2~0=v_~b2~0_In_1} AuxVars[] AssignedVars[][34], [Black: 99#(= ~b2~0 1), 77#(= ~X~0 1), Black: 103#(= ~b1~0 1), 3#L790true, 107#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 72#(= ~X~0 0), 10#L746-2true, Black: 79#true, 101#true, Black: 86#(= 2 ~x~0), 96#(<= ~x~0 1), 19#L783true, Black: 91#(= 2 ~y~0), 68#true]) [2024-11-19 09:21:06,335 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 09:21:06,335 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:21:06,335 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:21:06,335 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:21:06,336 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:21:06,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L757-->thr1EXIT: Formula: (and (= 0 |v_thr1Thread1of1ForFork1_#res#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_1|, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_#res#1.base][44], [Black: 99#(= ~b2~0 1), 107#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 41#thr2EXITtrue, Black: 103#(= ~b1~0 1), 3#L790true, 6#thr1EXITtrue, Black: 70#true, 101#true, Black: 81#(= ~y~0 1), Black: 86#(= 2 ~x~0), 96#(<= ~x~0 1), Black: 91#(= 2 ~y~0), 68#true]) [2024-11-19 09:21:06,336 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 09:21:06,336 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:21:06,336 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:21:06,336 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:21:06,340 INFO L124 PetriNetUnfolderBase]: 333/1007 cut-off events. [2024-11-19 09:21:06,340 INFO L125 PetriNetUnfolderBase]: For 256/288 co-relation queries the response was YES. [2024-11-19 09:21:06,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2159 conditions, 1007 events. 333/1007 cut-off events. For 256/288 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6903 event pairs, 131 based on Foata normal form. 4/893 useless extension candidates. Maximal degree in co-relation 2149. Up to 383 conditions per place. [2024-11-19 09:21:06,345 INFO L140 encePairwiseOnDemand]: 76/78 looper letters, 0 selfloop transitions, 0 changer transitions 69/69 dead transitions. [2024-11-19 09:21:06,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 69 transitions, 285 flow [2024-11-19 09:21:06,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:21:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:21:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2024-11-19 09:21:06,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-11-19 09:21:06,346 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 257 flow. Second operand 3 states and 169 transitions. [2024-11-19 09:21:06,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 69 transitions, 285 flow [2024-11-19 09:21:06,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:21:06,348 INFO L231 Difference]: Finished difference. Result has 65 places, 0 transitions, 0 flow [2024-11-19 09:21:06,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=65, PETRI_TRANSITIONS=0} [2024-11-19 09:21:06,351 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2024-11-19 09:21:06,351 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 0 transitions, 0 flow [2024-11-19 09:21:06,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:21:06,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-19 09:21:06,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-19 09:21:06,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-19 09:21:06,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-19 09:21:06,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-19 09:21:06,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-19 09:21:06,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-19 09:21:06,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:21:06,357 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:06,366 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:21:06,366 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:21:06,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:21:06 BasicIcfg [2024-11-19 09:21:06,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:21:06,372 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:21:06,372 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:21:06,372 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:21:06,372 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:21:03" (3/4) ... [2024-11-19 09:21:06,374 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 09:21:06,377 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2024-11-19 09:21:06,377 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2024-11-19 09:21:06,380 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2024-11-19 09:21:06,381 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-19 09:21:06,381 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 09:21:06,381 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 09:21:06,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 09:21:06,463 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 09:21:06,463 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:21:06,463 INFO L158 Benchmark]: Toolchain (without parser) took 4086.61ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 92.4MB in the beginning and 79.9MB in the end (delta: 12.5MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,464 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:21:06,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.78ms. Allocated memory is still 151.0MB. Free memory was 92.1MB in the beginning and 114.6MB in the end (delta: -22.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.62ms. Allocated memory is still 151.0MB. Free memory was 114.6MB in the beginning and 112.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,464 INFO L158 Benchmark]: Boogie Preprocessor took 78.90ms. Allocated memory is still 151.0MB. Free memory was 112.6MB in the beginning and 110.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,465 INFO L158 Benchmark]: RCFGBuilder took 503.45ms. Allocated memory is still 151.0MB. Free memory was 110.3MB in the beginning and 91.7MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,465 INFO L158 Benchmark]: TraceAbstraction took 2823.78ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 90.8MB in the beginning and 84.1MB in the end (delta: 6.8MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,465 INFO L158 Benchmark]: Witness Printer took 91.17ms. Allocated memory is still 182.5MB. Free memory was 84.1MB in the beginning and 79.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,466 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.16ms. Allocated memory is still 96.5MB. Free memory was 51.3MB in the beginning and 51.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.78ms. Allocated memory is still 151.0MB. Free memory was 92.1MB in the beginning and 114.6MB in the end (delta: -22.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.62ms. Allocated memory is still 151.0MB. Free memory was 114.6MB in the beginning and 112.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.90ms. Allocated memory is still 151.0MB. Free memory was 112.6MB in the beginning and 110.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 503.45ms. Allocated memory is still 151.0MB. Free memory was 110.3MB in the beginning and 91.7MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2823.78ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 90.8MB in the beginning and 84.1MB in the end (delta: 6.8MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * Witness Printer took 91.17ms. Allocated memory is still 182.5MB. Free memory was 84.1MB in the beginning and 79.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 786]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 406 IncrementalHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 35 mSDtfsCounter, 406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=8, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 229 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 09:21:06,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE