./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/weaver/parallel-misc-4.wvr.c -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 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:35:28,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:35:28,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:35:28,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:35:28,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:35:28,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:35:28,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:35:28,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:35:28,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:35:28,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:35:28,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:35:28,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:35:28,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:35:28,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:35:28,110 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:35:28,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:35:28,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:35:28,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:35:28,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:35:28,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:35:28,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:35:28,114 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:35:28,114 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:35:28,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:35:28,115 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:35:28,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:35:28,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:35:28,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:35:28,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:35:28,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:35:28,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:35:28,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:35:28,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:35:28,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:35:28,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:35:28,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:35:28,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:35:28,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:35:28,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:35:28,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:35:28,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:35:28,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:35:28,120 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 -> 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c [2024-11-17 03:35:28,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:35:28,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:35:28,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:35:28,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:35:28,456 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:35:28,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-17 03:35:29,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:35:30,052 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:35:30,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-17 03:35:30,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e4f4f7c/7eabe9ae24904de8b80eb005d77c17ad/FLAG7cd37ece9 [2024-11-17 03:35:30,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58e4f4f7c/7eabe9ae24904de8b80eb005d77c17ad [2024-11-17 03:35:30,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:35:30,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:35:30,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:35:30,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:35:30,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:35:30,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14768e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30, skipping insertion in model container [2024-11-17 03:35:30,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:35:30,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:35:30,694 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:35:30,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:35:30,740 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:35:30,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30 WrapperNode [2024-11-17 03:35:30,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:35:30,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:35:30,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:35:30,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:35:30,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,784 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-17 03:35:30,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:35:30,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:35:30,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:35:30,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:35:30,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,819 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-17 03:35:30,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:35:30,829 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:35:30,829 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:35:30,829 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:35:30,830 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (1/1) ... [2024-11-17 03:35:30,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:35:30,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:35:30,869 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-17 03:35:30,875 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-17 03:35:30,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:35:30,911 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-17 03:35:30,911 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-17 03:35:30,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-17 03:35:30,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-17 03:35:30,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-17 03:35:30,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-17 03:35:30,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:35:30,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:35:30,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:35:30,914 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:35:31,003 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:35:31,005 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:35:31,244 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:35:31,244 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:35:31,358 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:35:31,359 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:35:31,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:35:31 BoogieIcfgContainer [2024-11-17 03:35:31,360 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:35:31,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:35:31,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:35:31,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:35:31,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:35:30" (1/3) ... [2024-11-17 03:35:31,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d747d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:35:31, skipping insertion in model container [2024-11-17 03:35:31,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:35:30" (2/3) ... [2024-11-17 03:35:31,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d747d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:35:31, skipping insertion in model container [2024-11-17 03:35:31,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:35:31" (3/3) ... [2024-11-17 03:35:31,368 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2024-11-17 03:35:31,384 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:35:31,384 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 03:35:31,384 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:35:31,435 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-17 03:35:31,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 49 transitions, 119 flow [2024-11-17 03:35:31,500 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2024-11-17 03:35:31,500 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-17 03:35:31,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 6/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 96 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-17 03:35:31,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 49 transitions, 119 flow [2024-11-17 03:35:31,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 45 transitions, 108 flow [2024-11-17 03:35:31,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:35:31,529 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;@273c8409, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:35:31,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-17 03:35:31,555 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:35:31,555 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2024-11-17 03:35:31,556 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-17 03:35:31,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:35:31,557 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-17 03:35:31,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-17 03:35:31,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:35:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -418083155, now seen corresponding path program 1 times [2024-11-17 03:35:31,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:35:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389131980] [2024-11-17 03:35:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:31,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:35:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:31,807 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-17 03:35:31,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:35:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389131980] [2024-11-17 03:35:31,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389131980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:35:31,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:35:31,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:35:31,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576361511] [2024-11-17 03:35:31,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:35:31,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 03:35:31,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:35:31,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 03:35:31,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:35:31,851 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 49 [2024-11-17 03:35:31,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 108 flow. Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-17 03:35:31,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:35:31,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 49 [2024-11-17 03:35:31,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:35:32,005 INFO L124 PetriNetUnfolderBase]: 210/377 cut-off events. [2024-11-17 03:35:32,005 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-17 03:35:32,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 377 events. 210/377 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2081 event pairs, 169 based on Foata normal form. 61/373 useless extension candidates. Maximal degree in co-relation 661. Up to 327 conditions per place. [2024-11-17 03:35:32,019 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 22 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2024-11-17 03:35:32,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 144 flow [2024-11-17 03:35:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 03:35:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-17 03:35:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2024-11-17 03:35:32,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7244897959183674 [2024-11-17 03:35:32,033 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 108 flow. Second operand 2 states and 71 transitions. [2024-11-17 03:35:32,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 144 flow [2024-11-17 03:35:32,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 132 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-17 03:35:32,039 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 88 flow [2024-11-17 03:35:32,042 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2024-11-17 03:35:32,049 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2024-11-17 03:35:32,049 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 88 flow [2024-11-17 03:35:32,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-17 03:35:32,050 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:35:32,050 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] [2024-11-17 03:35:32,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:35:32,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-17 03:35:32,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:35:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash -896146246, now seen corresponding path program 1 times [2024-11-17 03:35:32,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:35:32,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688857534] [2024-11-17 03:35:32,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:32,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:35:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:32,258 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-17 03:35:32,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:35:32,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688857534] [2024-11-17 03:35:32,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688857534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:35:32,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:35:32,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:35:32,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820990815] [2024-11-17 03:35:32,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:35:32,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:35:32,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:35:32,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:35:32,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:35:32,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-17 03:35:32,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-17 03:35:32,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:35:32,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-17 03:35:32,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:35:32,483 INFO L124 PetriNetUnfolderBase]: 523/926 cut-off events. [2024-11-17 03:35:32,484 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:35:32,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1739 conditions, 926 events. 523/926 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5076 event pairs, 191 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1736. Up to 442 conditions per place. [2024-11-17 03:35:32,511 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 30 selfloop transitions, 4 changer transitions 3/52 dead transitions. [2024-11-17 03:35:32,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 185 flow [2024-11-17 03:35:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:35:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:35:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-17 03:35:32,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-11-17 03:35:32,514 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 88 flow. Second operand 3 states and 96 transitions. [2024-11-17 03:35:32,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 185 flow [2024-11-17 03:35:32,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 185 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-17 03:35:32,519 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 116 flow [2024-11-17 03:35:32,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2024-11-17 03:35:32,520 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-17 03:35:32,521 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 116 flow [2024-11-17 03:35:32,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-17 03:35:32,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:35:32,521 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] [2024-11-17 03:35:32,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:35:32,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-17 03:35:32,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:35:32,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1553276438, now seen corresponding path program 2 times [2024-11-17 03:35:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:35:32,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855559427] [2024-11-17 03:35:32,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:32,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:35:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:32,789 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-17 03:35:32,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:35:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855559427] [2024-11-17 03:35:32,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855559427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:35:32,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:35:32,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:35:32,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485244113] [2024-11-17 03:35:32,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:35:32,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:35:32,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:35:32,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:35:32,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:35:32,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-11-17 03:35:32,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-17 03:35:32,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:35:32,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-11-17 03:35:32,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:35:33,054 INFO L124 PetriNetUnfolderBase]: 790/1607 cut-off events. [2024-11-17 03:35:33,055 INFO L125 PetriNetUnfolderBase]: For 277/288 co-relation queries the response was YES. [2024-11-17 03:35:33,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3053 conditions, 1607 events. 790/1607 cut-off events. For 277/288 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10551 event pairs, 164 based on Foata normal form. 57/1431 useless extension candidates. Maximal degree in co-relation 3048. Up to 656 conditions per place. [2024-11-17 03:35:33,067 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 38 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2024-11-17 03:35:33,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 258 flow [2024-11-17 03:35:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:35:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:35:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-11-17 03:35:33,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2024-11-17 03:35:33,073 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 116 flow. Second operand 5 states and 155 transitions. [2024-11-17 03:35:33,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 258 flow [2024-11-17 03:35:33,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:35:33,077 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 165 flow [2024-11-17 03:35:33,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-11-17 03:35:33,079 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2024-11-17 03:35:33,079 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 165 flow [2024-11-17 03:35:33,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-17 03:35:33,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:35:33,080 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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-17 03:35:33,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:35:33,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-17 03:35:33,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:35:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash -509006369, now seen corresponding path program 1 times [2024-11-17 03:35:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:35:33,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102237446] [2024-11-17 03:35:33,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:33,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:35:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:33,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:35:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102237446] [2024-11-17 03:35:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102237446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:35:33,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:35:33,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:35:33,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016567528] [2024-11-17 03:35:33,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:35:33,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:35:33,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:35:33,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:35:33,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:35:33,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-17 03:35:33,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-17 03:35:33,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:35:33,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-17 03:35:33,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:35:33,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_16) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_15 1))) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0][50], [38#L46true, 72#true, 25#L88-1true, Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 14#L55true, Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 31#L71true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,432 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,433 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,433 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,433 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-17 03:35:33,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork0_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0][34], [72#true, 25#L88-1true, 24#L43true, Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 14#L55true, 63#true, 31#L71true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,435 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,435 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-17 03:35:33,435 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,435 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [72#true, 25#L88-1true, Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 31#L71true, 7#L56true, 56#true, 36#L42true, Black: 58#true]) [2024-11-17 03:35:33,444 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,444 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-17 03:35:33,444 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,444 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_16) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_15 1))) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0][50], [38#L46true, 72#true, 25#L88-1true, Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 14#L55true, Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 35#thread3EXITtrue, 56#true, Black: 58#true]) [2024-11-17 03:35:33,446 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-17 03:35:33,446 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,446 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,446 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork0_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0][34], [72#true, 24#L43true, 25#L88-1true, Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 14#L55true, 63#true, 35#thread3EXITtrue, 56#true, Black: 58#true]) [2024-11-17 03:35:33,446 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-17 03:35:33,447 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,447 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,447 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_16) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_15 1))) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0][50], [38#L46true, 72#true, 4#L89true, Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 14#L55true, 63#true, 31#L71true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,454 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-17 03:35:33,454 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,454 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,454 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork0_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0][34], [72#true, 4#L89true, 24#L43true, Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 14#L55true, 63#true, 31#L71true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,456 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-17 03:35:33,456 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,457 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,457 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [72#true, 4#L89true, Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 7#L56true, 31#L71true, 56#true, 36#L42true, Black: 58#true]) [2024-11-17 03:35:33,501 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-17 03:35:33,501 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,501 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,501 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_16) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_15 1))) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0][50], [38#L46true, 72#true, 4#L89true, Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 14#L55true, Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 35#thread3EXITtrue, 56#true, Black: 58#true]) [2024-11-17 03:35:33,502 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-17 03:35:33,502 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,502 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-17 03:35:33,502 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-17 03:35:33,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork0_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0][34], [72#true, 4#L89true, 24#L43true, Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 14#L55true, 63#true, 35#thread3EXITtrue, 56#true, Black: 58#true]) [2024-11-17 03:35:33,503 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-17 03:35:33,503 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-17 03:35:33,503 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-17 03:35:33,503 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_16) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_15 1))) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0][42], [38#L46true, 4#L89true, 26#L57-1true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 35#thread3EXITtrue, 63#true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,513 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,513 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,514 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,514 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_16) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_15 1))) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0][42], [38#L46true, 4#L89true, 26#L57-1true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 31#L71true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,514 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-17 03:35:33,514 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-17 03:35:33,514 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-17 03:35:33,514 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-17 03:35:33,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_16) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_15 1))) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0][42], [38#L46true, 25#L88-1true, 18#L62true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 31#L71true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,515 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-17 03:35:33,515 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-17 03:35:33,515 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-17 03:35:33,516 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-17 03:35:33,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_16) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_15 1))) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0][42], [38#L46true, 25#L88-1true, 18#L62true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 35#thread3EXITtrue, 56#true, Black: 58#true]) [2024-11-17 03:35:33,516 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,516 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,516 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,516 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork0_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0][21], [4#L89true, 24#L43true, 26#L57-1true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 35#thread3EXITtrue, 63#true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,519 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,519 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,519 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,519 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork0_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0][21], [4#L89true, 24#L43true, 26#L57-1true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 31#L71true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,520 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-17 03:35:33,520 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-17 03:35:33,520 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-17 03:35:33,520 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-17 03:35:33,520 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork0_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0][21], [25#L88-1true, 24#L43true, 18#L62true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 31#L71true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,520 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-17 03:35:33,521 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-17 03:35:33,521 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-17 03:35:33,521 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-17 03:35:33,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork0_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0][21], [25#L88-1true, 24#L43true, 18#L62true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 35#thread3EXITtrue, 56#true, Black: 58#true]) [2024-11-17 03:35:33,521 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,524 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,524 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,524 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_16) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_15 1))) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0][42], [38#L46true, 4#L89true, 18#L62true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 31#L71true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,536 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,537 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,537 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,537 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~post2_1| v_~pos~0_16) (= |v_thread1Thread1of1ForFork0_#t~post2_1| (+ v_~pos~0_15 1))) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0][42], [38#L46true, 4#L89true, 18#L62true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 35#thread3EXITtrue, 63#true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,537 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-17 03:35:33,537 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,537 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,538 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-17 03:35:33,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork0_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0][21], [4#L89true, 24#L43true, 18#L62true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 31#L71true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,539 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,539 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-17 03:35:33,539 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,539 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-17 03:35:33,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork0_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0][21], [4#L89true, 24#L43true, 18#L62true, 74#(<= 1 (mod ~d2~0 256)), Black: 65#(<= 0 ~pos~0), Black: 66#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 35#thread3EXITtrue, 63#true, 56#true, Black: 58#true]) [2024-11-17 03:35:33,539 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-17 03:35:33,539 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-17 03:35:33,540 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,540 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-17 03:35:33,552 INFO L124 PetriNetUnfolderBase]: 1900/3258 cut-off events. [2024-11-17 03:35:33,552 INFO L125 PetriNetUnfolderBase]: For 1871/2052 co-relation queries the response was YES. [2024-11-17 03:35:33,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7518 conditions, 3258 events. 1900/3258 cut-off events. For 1871/2052 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 20955 event pairs, 739 based on Foata normal form. 1/2523 useless extension candidates. Maximal degree in co-relation 7510. Up to 1270 conditions per place. [2024-11-17 03:35:33,577 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 44 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2024-11-17 03:35:33,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 318 flow [2024-11-17 03:35:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:35:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:35:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-11-17 03:35:33,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6802721088435374 [2024-11-17 03:35:33,579 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 165 flow. Second operand 3 states and 100 transitions. [2024-11-17 03:35:33,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 318 flow [2024-11-17 03:35:33,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:35:33,584 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 182 flow [2024-11-17 03:35:33,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-11-17 03:35:33,585 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-17 03:35:33,585 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 182 flow [2024-11-17 03:35:33,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-17 03:35:33,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:35:33,586 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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-17 03:35:33,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:35:33,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-17 03:35:33,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:35:33,587 INFO L85 PathProgramCache]: Analyzing trace with hash 287562020, now seen corresponding path program 1 times [2024-11-17 03:35:33,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:35:33,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407336056] [2024-11-17 03:35:33,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:33,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:35:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:33,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:35:33,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407336056] [2024-11-17 03:35:33,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407336056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:35:33,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:35:33,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:35:33,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448862643] [2024-11-17 03:35:33,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:35:33,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:35:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:35:33,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:35:33,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:35:33,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-17 03:35:33,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-17 03:35:33,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:35:33,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-17 03:35:33,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:35:33,988 INFO L124 PetriNetUnfolderBase]: 2222/4014 cut-off events. [2024-11-17 03:35:33,989 INFO L125 PetriNetUnfolderBase]: For 1997/2081 co-relation queries the response was YES. [2024-11-17 03:35:34,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9180 conditions, 4014 events. 2222/4014 cut-off events. For 1997/2081 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 27248 event pairs, 909 based on Foata normal form. 1/3461 useless extension candidates. Maximal degree in co-relation 9171. Up to 1622 conditions per place. [2024-11-17 03:35:34,015 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 44 selfloop transitions, 3 changer transitions 2/69 dead transitions. [2024-11-17 03:35:34,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 343 flow [2024-11-17 03:35:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:35:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:35:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-17 03:35:34,017 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2024-11-17 03:35:34,017 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 182 flow. Second operand 3 states and 102 transitions. [2024-11-17 03:35:34,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 343 flow [2024-11-17 03:35:34,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:35:34,025 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 192 flow [2024-11-17 03:35:34,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-11-17 03:35:34,026 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-11-17 03:35:34,026 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 192 flow [2024-11-17 03:35:34,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-17 03:35:34,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:35:34,027 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 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-17 03:35:34,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:35:34,027 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-17 03:35:34,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:35:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash -184821334, now seen corresponding path program 1 times [2024-11-17 03:35:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:35:34,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108625473] [2024-11-17 03:35:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:35:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:34,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:35:34,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108625473] [2024-11-17 03:35:34,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108625473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:35:34,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599868147] [2024-11-17 03:35:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:34,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:35:34,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:35:34,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 03:35:34,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 03:35:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:34,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 03:35:34,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:35:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:34,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:35:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:34,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599868147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:35:34,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:35:34,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-11-17 03:35:34,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246939314] [2024-11-17 03:35:34,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:35:34,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:35:34,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:35:34,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:35:34,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:35:34,650 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-17 03:35:34,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 192 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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-17 03:35:34,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:35:34,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-17 03:35:34,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:35:35,458 INFO L124 PetriNetUnfolderBase]: 3412/6689 cut-off events. [2024-11-17 03:35:35,459 INFO L125 PetriNetUnfolderBase]: For 4867/4889 co-relation queries the response was YES. [2024-11-17 03:35:35,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16341 conditions, 6689 events. 3412/6689 cut-off events. For 4867/4889 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 50652 event pairs, 316 based on Foata normal form. 160/6580 useless extension candidates. Maximal degree in co-relation 16331. Up to 1395 conditions per place. [2024-11-17 03:35:35,499 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 59 selfloop transitions, 20 changer transitions 26/124 dead transitions. [2024-11-17 03:35:35,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 124 transitions, 659 flow [2024-11-17 03:35:35,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:35:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:35:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 267 transitions. [2024-11-17 03:35:35,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2024-11-17 03:35:35,565 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 192 flow. Second operand 9 states and 267 transitions. [2024-11-17 03:35:35,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 124 transitions, 659 flow [2024-11-17 03:35:35,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 124 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:35:35,577 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 369 flow [2024-11-17 03:35:35,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=369, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-11-17 03:35:35,578 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2024-11-17 03:35:35,579 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 369 flow [2024-11-17 03:35:35,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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-17 03:35:35,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:35:35,579 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 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-17 03:35:35,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 03:35:35,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-17 03:35:35,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-17 03:35:35,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:35:35,785 INFO L85 PathProgramCache]: Analyzing trace with hash 396738783, now seen corresponding path program 1 times [2024-11-17 03:35:35,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:35:35,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889879661] [2024-11-17 03:35:35,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:35,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:35:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:35,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:35:35,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889879661] [2024-11-17 03:35:35,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889879661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:35:35,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210309451] [2024-11-17 03:35:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:35,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:35:35,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:35:35,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 03:35:35,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 03:35:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:36,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:35:36,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:35:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:36,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:35:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:36,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210309451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:35:36,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:35:36,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-11-17 03:35:36,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044148597] [2024-11-17 03:35:36,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:35:36,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 03:35:36,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:35:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 03:35:36,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-17 03:35:36,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-17 03:35:36,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 369 flow. Second operand has 11 states, 11 states have (on average 22.727272727272727) internal successors, (250), 11 states have internal predecessors, (250), 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-17 03:35:36,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:35:36,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-17 03:35:36,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:35:37,436 INFO L124 PetriNetUnfolderBase]: 4419/9274 cut-off events. [2024-11-17 03:35:37,437 INFO L125 PetriNetUnfolderBase]: For 20530/20632 co-relation queries the response was YES. [2024-11-17 03:35:37,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27436 conditions, 9274 events. 4419/9274 cut-off events. For 20530/20632 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 76823 event pairs, 268 based on Foata normal form. 180/8885 useless extension candidates. Maximal degree in co-relation 27420. Up to 2240 conditions per place. [2024-11-17 03:35:37,510 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 76 selfloop transitions, 30 changer transitions 30/155 dead transitions. [2024-11-17 03:35:37,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 155 transitions, 1157 flow [2024-11-17 03:35:37,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:35:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:35:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 267 transitions. [2024-11-17 03:35:37,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2024-11-17 03:35:37,512 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 369 flow. Second operand 9 states and 267 transitions. [2024-11-17 03:35:37,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 155 transitions, 1157 flow [2024-11-17 03:35:37,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 155 transitions, 1032 flow, removed 61 selfloop flow, removed 3 redundant places. [2024-11-17 03:35:37,557 INFO L231 Difference]: Finished difference. Result has 76 places, 83 transitions, 602 flow [2024-11-17 03:35:37,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=76, PETRI_TRANSITIONS=83} [2024-11-17 03:35:37,558 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2024-11-17 03:35:37,558 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 83 transitions, 602 flow [2024-11-17 03:35:37,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.727272727272727) internal successors, (250), 11 states have internal predecessors, (250), 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-17 03:35:37,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:35:37,559 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 2, 2, 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-17 03:35:37,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 03:35:37,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-17 03:35:37,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-17 03:35:37,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:35:37,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1516658787, now seen corresponding path program 2 times [2024-11-17 03:35:37,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:35:37,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443308922] [2024-11-17 03:35:37,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:37,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:35:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:35:37,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:35:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443308922] [2024-11-17 03:35:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443308922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:35:37,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:35:37,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:35:37,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988242754] [2024-11-17 03:35:37,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:35:37,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:35:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:35:37,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:35:37,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:35:37,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-17 03:35:37,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 83 transitions, 602 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-17 03:35:37,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:35:37,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-17 03:35:37,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:35:39,125 INFO L124 PetriNetUnfolderBase]: 5566/10691 cut-off events. [2024-11-17 03:35:39,125 INFO L125 PetriNetUnfolderBase]: For 31158/33194 co-relation queries the response was YES. [2024-11-17 03:35:39,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34708 conditions, 10691 events. 5566/10691 cut-off events. For 31158/33194 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 86144 event pairs, 1895 based on Foata normal form. 228/9123 useless extension candidates. Maximal degree in co-relation 34688. Up to 3164 conditions per place. [2024-11-17 03:35:39,211 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 104 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2024-11-17 03:35:39,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 135 transitions, 1176 flow [2024-11-17 03:35:39,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:35:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:35:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-17 03:35:39,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2024-11-17 03:35:39,213 INFO L175 Difference]: Start difference. First operand has 76 places, 83 transitions, 602 flow. Second operand 4 states and 136 transitions. [2024-11-17 03:35:39,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 135 transitions, 1176 flow [2024-11-17 03:35:39,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 135 transitions, 1130 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-11-17 03:35:39,247 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 606 flow [2024-11-17 03:35:39,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=606, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2024-11-17 03:35:39,248 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2024-11-17 03:35:39,248 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 606 flow [2024-11-17 03:35:39,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-17 03:35:39,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:35:39,249 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 2, 2, 2, 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-17 03:35:39,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:35:39,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-17 03:35:39,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:35:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1055416817, now seen corresponding path program 2 times [2024-11-17 03:35:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:35:39,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376272793] [2024-11-17 03:35:39,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:35:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:35:39,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:35:39,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376272793] [2024-11-17 03:35:39,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376272793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:35:39,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:35:39,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:35:39,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034431805] [2024-11-17 03:35:39,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:35:39,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:35:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:35:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:35:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:35:39,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-17 03:35:39,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 606 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-17 03:35:39,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:35:39,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-17 03:35:39,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:35:40,561 INFO L124 PetriNetUnfolderBase]: 5098/10347 cut-off events. [2024-11-17 03:35:40,561 INFO L125 PetriNetUnfolderBase]: For 30234/31389 co-relation queries the response was YES. [2024-11-17 03:35:40,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34268 conditions, 10347 events. 5098/10347 cut-off events. For 30234/31389 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 84197 event pairs, 1421 based on Foata normal form. 153/9611 useless extension candidates. Maximal degree in co-relation 34248. Up to 3111 conditions per place. [2024-11-17 03:35:40,606 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 91 selfloop transitions, 5 changer transitions 10/131 dead transitions. [2024-11-17 03:35:40,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 131 transitions, 1119 flow [2024-11-17 03:35:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:35:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:35:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-11-17 03:35:40,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6887755102040817 [2024-11-17 03:35:40,608 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 606 flow. Second operand 4 states and 135 transitions. [2024-11-17 03:35:40,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 131 transitions, 1119 flow [2024-11-17 03:35:40,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 131 transitions, 1119 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-17 03:35:40,626 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 594 flow [2024-11-17 03:35:40,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=594, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2024-11-17 03:35:40,627 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-11-17 03:35:40,627 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 594 flow [2024-11-17 03:35:40,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-17 03:35:40,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:35:40,628 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 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-17 03:35:40,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:35:40,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-17 03:35:40,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:35:40,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1831722161, now seen corresponding path program 1 times [2024-11-17 03:35:40,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:35:40,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898884918] [2024-11-17 03:35:40,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:35:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:40,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:35:40,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898884918] [2024-11-17 03:35:40,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898884918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:35:40,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253118510] [2024-11-17 03:35:40,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:40,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:35:40,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:35:40,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 03:35:40,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 03:35:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:40,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 03:35:40,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:35:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:40,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:35:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253118510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:35:41,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:35:41,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2024-11-17 03:35:41,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139310150] [2024-11-17 03:35:41,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:35:41,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 03:35:41,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:35:41,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 03:35:41,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-17 03:35:41,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-17 03:35:41,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 594 flow. Second operand has 12 states, 12 states have (on average 20.666666666666668) internal successors, (248), 12 states have internal predecessors, (248), 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-17 03:35:41,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:35:41,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-17 03:35:41,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:35:44,292 INFO L124 PetriNetUnfolderBase]: 12945/24870 cut-off events. [2024-11-17 03:35:44,293 INFO L125 PetriNetUnfolderBase]: For 79175/79243 co-relation queries the response was YES. [2024-11-17 03:35:44,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88077 conditions, 24870 events. 12945/24870 cut-off events. For 79175/79243 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 217580 event pairs, 1243 based on Foata normal form. 312/25064 useless extension candidates. Maximal degree in co-relation 88054. Up to 5770 conditions per place. [2024-11-17 03:35:44,438 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 101 selfloop transitions, 56 changer transitions 161/334 dead transitions. [2024-11-17 03:35:44,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 334 transitions, 3102 flow [2024-11-17 03:35:44,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 03:35:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-17 03:35:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 423 transitions. [2024-11-17 03:35:44,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5395408163265306 [2024-11-17 03:35:44,441 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 594 flow. Second operand 16 states and 423 transitions. [2024-11-17 03:35:44,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 334 transitions, 3102 flow [2024-11-17 03:35:44,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 334 transitions, 3074 flow, removed 14 selfloop flow, removed 0 redundant places. [2024-11-17 03:35:44,529 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 1135 flow [2024-11-17 03:35:44,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1135, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2024-11-17 03:35:44,531 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 58 predicate places. [2024-11-17 03:35:44,531 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 1135 flow [2024-11-17 03:35:44,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.666666666666668) internal successors, (248), 12 states have internal predecessors, (248), 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-17 03:35:44,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:35:44,532 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 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-17 03:35:44,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 03:35:44,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:35:44,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-17 03:35:44,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:35:44,736 INFO L85 PathProgramCache]: Analyzing trace with hash 972062885, now seen corresponding path program 2 times [2024-11-17 03:35:44,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:35:44,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112825585] [2024-11-17 03:35:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:35:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:35:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:35:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:45,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:35:45,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112825585] [2024-11-17 03:35:45,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112825585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:35:45,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946893396] [2024-11-17 03:35:45,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:35:45,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:35:45,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:35:45,035 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 03:35:45,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 03:35:45,114 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:35:45,114 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:35:45,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 03:35:45,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:35:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:45,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:35:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:35:45,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946893396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:35:45,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:35:45,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 12 [2024-11-17 03:35:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961985117] [2024-11-17 03:35:45,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:35:45,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 03:35:45,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:35:45,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 03:35:45,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-17 03:35:45,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-17 03:35:45,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 113 transitions, 1135 flow. Second operand has 12 states, 12 states have (on average 23.0) internal successors, (276), 12 states have internal predecessors, (276), 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-17 03:35:45,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:35:45,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-17 03:35:45,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:35:46,333 INFO L124 PetriNetUnfolderBase]: 2813/6869 cut-off events. [2024-11-17 03:35:46,334 INFO L125 PetriNetUnfolderBase]: For 42449/42517 co-relation queries the response was YES. [2024-11-17 03:35:46,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27094 conditions, 6869 events. 2813/6869 cut-off events. For 42449/42517 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 59086 event pairs, 143 based on Foata normal form. 248/7100 useless extension candidates. Maximal degree in co-relation 27060. Up to 1850 conditions per place. [2024-11-17 03:35:46,364 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 0 selfloop transitions, 0 changer transitions 183/183 dead transitions. [2024-11-17 03:35:46,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 183 transitions, 2074 flow [2024-11-17 03:35:46,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:35:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:35:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions. [2024-11-17 03:35:46,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-11-17 03:35:46,366 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 1135 flow. Second operand 9 states and 243 transitions. [2024-11-17 03:35:46,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 183 transitions, 2074 flow [2024-11-17 03:35:46,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 183 transitions, 1821 flow, removed 56 selfloop flow, removed 14 redundant places. [2024-11-17 03:35:46,438 INFO L231 Difference]: Finished difference. Result has 87 places, 0 transitions, 0 flow [2024-11-17 03:35:46,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=87, PETRI_TRANSITIONS=0} [2024-11-17 03:35:46,438 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-17 03:35:46,438 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 0 transitions, 0 flow [2024-11-17 03:35:46,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.0) internal successors, (276), 12 states have internal predecessors, (276), 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-17 03:35:46,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-17 03:35:46,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-17 03:35:46,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-17 03:35:46,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-17 03:35:46,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-17 03:35:46,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 03:35:46,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:35:46,647 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1] [2024-11-17 03:35:46,650 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:35:46,650 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:35:46,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:35:46 BasicIcfg [2024-11-17 03:35:46,653 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:35:46,654 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:35:46,654 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:35:46,654 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:35:46,654 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:35:31" (3/4) ... [2024-11-17 03:35:46,656 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 03:35:46,658 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-17 03:35:46,658 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-17 03:35:46,658 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-17 03:35:46,661 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-17 03:35:46,662 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-17 03:35:46,662 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-17 03:35:46,662 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-17 03:35:46,725 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 03:35:46,726 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 03:35:46,726 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:35:46,726 INFO L158 Benchmark]: Toolchain (without parser) took 16304.08ms. Allocated memory was 165.7MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 133.0MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 648.9MB. Max. memory is 16.1GB. [2024-11-17 03:35:46,727 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 75.2MB in the beginning and 75.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:35:46,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.00ms. Allocated memory is still 165.7MB. Free memory was 132.0MB in the beginning and 119.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 03:35:46,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.56ms. Allocated memory is still 165.7MB. Free memory was 119.4MB in the beginning and 117.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:35:46,727 INFO L158 Benchmark]: Boogie Preprocessor took 41.13ms. Allocated memory is still 165.7MB. Free memory was 117.1MB in the beginning and 115.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:35:46,728 INFO L158 Benchmark]: IcfgBuilder took 530.77ms. Allocated memory is still 165.7MB. Free memory was 115.2MB in the beginning and 119.6MB in the end (delta: -4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 03:35:46,728 INFO L158 Benchmark]: TraceAbstraction took 15291.68ms. Allocated memory was 165.7MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 118.5MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 686.9MB. Max. memory is 16.1GB. [2024-11-17 03:35:46,728 INFO L158 Benchmark]: Witness Printer took 72.12ms. Allocated memory is still 4.2GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:35:46,729 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.17ms. Allocated memory is still 104.9MB. Free memory was 75.2MB in the beginning and 75.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.00ms. Allocated memory is still 165.7MB. Free memory was 132.0MB in the beginning and 119.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.56ms. Allocated memory is still 165.7MB. Free memory was 119.4MB in the beginning and 117.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.13ms. Allocated memory is still 165.7MB. Free memory was 117.1MB in the beginning and 115.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 530.77ms. Allocated memory is still 165.7MB. Free memory was 115.2MB in the beginning and 119.6MB in the end (delta: -4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15291.68ms. Allocated memory was 165.7MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 118.5MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 686.9MB. Max. memory is 16.1GB. * Witness Printer took 72.12ms. Allocated memory is still 4.2GB. Free memory was 3.5GB in the beginning and 3.5GB 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: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 74]: 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 7 procedures, 71 locations, 5 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: 15.2s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 727 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 695 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1587 IncrementalHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 16 mSDtfsCounter, 1587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 335 SyntacticMatches, 16 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1135occurred in iteration=10, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 734 ConstructedInterpolants, 0 QuantifiedInterpolants, 2005 SizeOfPredicates, 25 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 103/187 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-17 03:35:46,758 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