./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 023d838f 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-023d838-m [2024-11-10 18:16:18,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:16:18,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:16:18,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:16:18,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:16:18,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:16:18,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:16:18,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:16:18,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:16:18,796 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:16:18,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:16:18,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:16:18,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:16:18,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:16:18,798 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:16:18,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:16:18,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:16:18,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:16:18,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:16:18,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:16:18,800 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:16:18,805 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:16:18,805 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:16:18,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:16:18,806 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:16:18,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:16:18,806 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:16:18,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:16:18,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:16:18,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:16:18,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:16:18,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:16:18,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:16:18,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:16:18,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:16:18,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:16:18,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:16:18,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:16:18,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:16:18,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:16:18,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:16:18,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:16:18,811 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-10 18:16:19,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:16:19,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:16:19,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:16:19,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:16:19,188 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:16:19,189 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-10 18:16:20,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:16:20,840 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:16:20,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-10 18:16:20,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f53890c/5d9c5eec3e2f4cdcbe53f6e90e3e65f9/FLAG943590c3b [2024-11-10 18:16:21,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f53890c/5d9c5eec3e2f4cdcbe53f6e90e3e65f9 [2024-11-10 18:16:21,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:16:21,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:16:21,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:16:21,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:16:21,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:16:21,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aba77eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21, skipping insertion in model container [2024-11-10 18:16:21,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:16:21,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:16:21,492 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:16:21,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:16:21,572 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:16:21,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21 WrapperNode [2024-11-10 18:16:21,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:16:21,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:16:21,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:16:21,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:16:21,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,629 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-10 18:16:21,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:16:21,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:16:21,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:16:21,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:16:21,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,673 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-10 18:16:21,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,678 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:16:21,686 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:16:21,686 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:16:21,686 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:16:21,687 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (1/1) ... [2024-11-10 18:16:21,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:16:21,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:16:21,733 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-10 18:16:21,736 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-10 18:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 18:16:21,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 18:16:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 18:16:21,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 18:16:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 18:16:21,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 18:16:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:16:21,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:16:21,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:16:21,830 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:16:22,083 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:16:22,085 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:16:22,267 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:16:22,267 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:16:22,341 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:16:22,341 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:16:22,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:16:22 BoogieIcfgContainer [2024-11-10 18:16:22,342 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:16:22,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:16:22,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:16:22,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:16:22,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:16:21" (1/3) ... [2024-11-10 18:16:22,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2beed65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:16:22, skipping insertion in model container [2024-11-10 18:16:22,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:16:21" (2/3) ... [2024-11-10 18:16:22,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2beed65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:16:22, skipping insertion in model container [2024-11-10 18:16:22,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:16:22" (3/3) ... [2024-11-10 18:16:22,348 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2024-11-10 18:16:22,360 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:16:22,360 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 18:16:22,360 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:16:22,405 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 18:16:22,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 49 transitions, 119 flow [2024-11-10 18:16:22,491 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2024-11-10 18:16:22,491 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 18:16:22,495 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-10 18:16:22,495 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 49 transitions, 119 flow [2024-11-10 18:16:22,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 45 transitions, 108 flow [2024-11-10 18:16:22,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:16:22,515 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;@31bdd363, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:16:22,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 18:16:22,527 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:16:22,528 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2024-11-10 18:16:22,528 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 18:16:22,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:16:22,529 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-10 18:16:22,530 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-10 18:16:22,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:16:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash -418083155, now seen corresponding path program 1 times [2024-11-10 18:16:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:16:22,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097473295] [2024-11-10 18:16:22,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:22,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:16:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:22,797 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-10 18:16:22,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:16:22,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097473295] [2024-11-10 18:16:22,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097473295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:16:22,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:16:22,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:16:22,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127911406] [2024-11-10 18:16:22,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:16:22,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:16:22,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:16:22,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:16:22,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:16:22,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 49 [2024-11-10 18:16:22,854 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-10 18:16:22,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:16:22,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 49 [2024-11-10 18:16:22,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:16:22,994 INFO L124 PetriNetUnfolderBase]: 210/377 cut-off events. [2024-11-10 18:16:22,995 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 18:16:22,999 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-10 18:16:23,004 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 22 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2024-11-10 18:16:23,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 144 flow [2024-11-10 18:16:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:16:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:16:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2024-11-10 18:16:23,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7244897959183674 [2024-11-10 18:16:23,020 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 108 flow. Second operand 2 states and 71 transitions. [2024-11-10 18:16:23,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 144 flow [2024-11-10 18:16:23,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 132 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 18:16:23,029 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 88 flow [2024-11-10 18:16:23,031 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-10 18:16:23,035 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2024-11-10 18:16:23,036 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 88 flow [2024-11-10 18:16:23,037 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-10 18:16:23,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:16:23,037 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-10 18:16:23,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:16:23,038 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-10 18:16:23,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:16:23,039 INFO L85 PathProgramCache]: Analyzing trace with hash -896146246, now seen corresponding path program 1 times [2024-11-10 18:16:23,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:16:23,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490105530] [2024-11-10 18:16:23,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:23,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:16:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:23,187 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-10 18:16:23,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:16:23,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490105530] [2024-11-10 18:16:23,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490105530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:16:23,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:16:23,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:16:23,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810348373] [2024-11-10 18:16:23,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:16:23,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:16:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:16:23,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:16:23,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:16:23,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-10 18:16:23,200 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-10 18:16:23,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:16:23,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-10 18:16:23,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:16:23,375 INFO L124 PetriNetUnfolderBase]: 523/926 cut-off events. [2024-11-10 18:16:23,376 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:16:23,380 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-10 18:16:23,385 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 30 selfloop transitions, 4 changer transitions 3/52 dead transitions. [2024-11-10 18:16:23,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 185 flow [2024-11-10 18:16:23,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:16:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:16:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-10 18:16:23,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-11-10 18:16:23,388 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 88 flow. Second operand 3 states and 96 transitions. [2024-11-10 18:16:23,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 185 flow [2024-11-10 18:16:23,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 185 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:16:23,391 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 116 flow [2024-11-10 18:16:23,391 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-10 18:16:23,392 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-10 18:16:23,392 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 116 flow [2024-11-10 18:16:23,392 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-10 18:16:23,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:16:23,393 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-10 18:16:23,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:16:23,393 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-10 18:16:23,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:16:23,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1553276438, now seen corresponding path program 2 times [2024-11-10 18:16:23,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:16:23,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509061271] [2024-11-10 18:16:23,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:23,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:16:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:23,599 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-10 18:16:23,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:16:23,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509061271] [2024-11-10 18:16:23,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509061271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:16:23,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:16:23,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:16:23,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503778568] [2024-11-10 18:16:23,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:16:23,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:16:23,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:16:23,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:16:23,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:16:23,619 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-11-10 18:16:23,619 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-10 18:16:23,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:16:23,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-11-10 18:16:23,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:16:23,896 INFO L124 PetriNetUnfolderBase]: 790/1607 cut-off events. [2024-11-10 18:16:23,896 INFO L125 PetriNetUnfolderBase]: For 277/288 co-relation queries the response was YES. [2024-11-10 18:16:23,905 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-10 18:16:23,915 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 38 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2024-11-10 18:16:23,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 258 flow [2024-11-10 18:16:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:16:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:16:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-11-10 18:16:23,918 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2024-11-10 18:16:23,918 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 116 flow. Second operand 5 states and 155 transitions. [2024-11-10 18:16:23,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 258 flow [2024-11-10 18:16:23,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:16:23,924 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 165 flow [2024-11-10 18:16:23,925 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-10 18:16:23,927 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2024-11-10 18:16:23,927 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 165 flow [2024-11-10 18:16:23,928 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-10 18:16:23,928 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:16:23,928 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-10 18:16:23,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:16:23,929 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-10 18:16:23,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:16:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash -509006369, now seen corresponding path program 1 times [2024-11-10 18:16:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:16:23,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020457109] [2024-11-10 18:16:23,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:16:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:24,047 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-10 18:16:24,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:16:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020457109] [2024-11-10 18:16:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020457109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:16:24,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:16:24,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:16:24,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936666050] [2024-11-10 18:16:24,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:16:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:16:24,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:16:24,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:16:24,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:16:24,063 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-10 18:16:24,063 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-10 18:16:24,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:16:24,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-10 18:16:24,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:16:24,326 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-10 18:16:24,327 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,327 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,328 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,328 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-10 18:16:24,330 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-10 18:16:24,330 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,330 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-10 18:16:24,330 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,330 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,337 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-10 18:16:24,337 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,338 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-10 18:16:24,338 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,338 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,340 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-10 18:16:24,340 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-10 18:16:24,340 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,340 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,340 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,342 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-10 18:16:24,342 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-10 18:16:24,342 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,342 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,342 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,349 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-10 18:16:24,349 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-10 18:16:24,349 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,349 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,349 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,351 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-10 18:16:24,352 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-10 18:16:24,352 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,352 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,352 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,360 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-10 18:16:24,360 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-10 18:16:24,360 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,360 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,360 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,361 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-10 18:16:24,361 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-10 18:16:24,361 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,361 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-10 18:16:24,361 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-10 18:16:24,362 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-10 18:16:24,362 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-10 18:16:24,362 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-10 18:16:24,362 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-10 18:16:24,362 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,371 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-10 18:16:24,372 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,372 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,372 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,372 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,372 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-10 18:16:24,372 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-10 18:16:24,373 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-10 18:16:24,373 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-10 18:16:24,373 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-10 18:16:24,373 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-10 18:16:24,374 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-10 18:16:24,374 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-10 18:16:24,374 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-10 18:16:24,374 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-10 18:16:24,375 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-10 18:16:24,375 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,375 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,375 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,375 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,376 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-10 18:16:24,376 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,376 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,376 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,376 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,376 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-10 18:16:24,377 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-10 18:16:24,377 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-10 18:16:24,377 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-10 18:16:24,377 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-10 18:16:24,377 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-10 18:16:24,377 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-10 18:16:24,377 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-10 18:16:24,377 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-10 18:16:24,377 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-10 18:16:24,378 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-10 18:16:24,378 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,378 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,378 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,378 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,392 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-10 18:16:24,393 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,393 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,394 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,394 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,394 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-10 18:16:24,394 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-10 18:16:24,394 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,395 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,395 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-10 18:16:24,396 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-10 18:16:24,396 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,396 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-10 18:16:24,396 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,397 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-10 18:16:24,397 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-10 18:16:24,397 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-10 18:16:24,397 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-10 18:16:24,398 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,398 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-10 18:16:24,412 INFO L124 PetriNetUnfolderBase]: 1900/3258 cut-off events. [2024-11-10 18:16:24,412 INFO L125 PetriNetUnfolderBase]: For 1871/2052 co-relation queries the response was YES. [2024-11-10 18:16:24,427 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-10 18:16:24,448 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 44 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2024-11-10 18:16:24,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 318 flow [2024-11-10 18:16:24,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:16:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:16:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-11-10 18:16:24,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6802721088435374 [2024-11-10 18:16:24,453 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 165 flow. Second operand 3 states and 100 transitions. [2024-11-10 18:16:24,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 318 flow [2024-11-10 18:16:24,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:16:24,463 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 182 flow [2024-11-10 18:16:24,464 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-10 18:16:24,465 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-10 18:16:24,466 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 182 flow [2024-11-10 18:16:24,466 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-10 18:16:24,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:16:24,467 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-10 18:16:24,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:16:24,467 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-10 18:16:24,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:16:24,468 INFO L85 PathProgramCache]: Analyzing trace with hash 287562020, now seen corresponding path program 1 times [2024-11-10 18:16:24,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:16:24,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778158965] [2024-11-10 18:16:24,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:24,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:16:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:24,545 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-10 18:16:24,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:16:24,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778158965] [2024-11-10 18:16:24,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778158965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:16:24,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:16:24,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:16:24,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661246377] [2024-11-10 18:16:24,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:16:24,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:16:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:16:24,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:16:24,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:16:24,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-10 18:16:24,553 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-10 18:16:24,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:16:24,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-10 18:16:24,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:16:24,871 INFO L124 PetriNetUnfolderBase]: 2222/4014 cut-off events. [2024-11-10 18:16:24,871 INFO L125 PetriNetUnfolderBase]: For 1997/2081 co-relation queries the response was YES. [2024-11-10 18:16:24,890 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-10 18:16:24,907 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 44 selfloop transitions, 3 changer transitions 2/69 dead transitions. [2024-11-10 18:16:24,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 343 flow [2024-11-10 18:16:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:16:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:16:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-10 18:16:24,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2024-11-10 18:16:24,910 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 182 flow. Second operand 3 states and 102 transitions. [2024-11-10 18:16:24,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 343 flow [2024-11-10 18:16:24,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:16:24,918 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 192 flow [2024-11-10 18:16:24,918 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-10 18:16:24,919 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-11-10 18:16:24,919 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 192 flow [2024-11-10 18:16:24,919 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-10 18:16:24,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:16:24,920 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-10 18:16:24,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:16:24,920 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-10 18:16:24,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:16:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash -184821334, now seen corresponding path program 1 times [2024-11-10 18:16:24,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:16:24,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859160907] [2024-11-10 18:16:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:24,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:16:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:25,087 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-10 18:16:25,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:16:25,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859160907] [2024-11-10 18:16:25,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859160907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:16:25,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400534802] [2024-11-10 18:16:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:25,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:16:25,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:16:25,091 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-10 18:16:25,092 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-10 18:16:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:25,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:16:25,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:16:25,311 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-10 18:16:25,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:16:25,414 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-10 18:16:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400534802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:16:25,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:16:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-11-10 18:16:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931616463] [2024-11-10 18:16:25,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:16:25,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:16:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:16:25,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:16:25,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:16:25,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-10 18:16:25,433 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-10 18:16:25,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:16:25,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-10 18:16:25,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:16:26,133 INFO L124 PetriNetUnfolderBase]: 3412/6689 cut-off events. [2024-11-10 18:16:26,133 INFO L125 PetriNetUnfolderBase]: For 4867/4889 co-relation queries the response was YES. [2024-11-10 18:16:26,157 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-10 18:16:26,176 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 59 selfloop transitions, 20 changer transitions 26/124 dead transitions. [2024-11-10 18:16:26,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 124 transitions, 659 flow [2024-11-10 18:16:26,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:16:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:16:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 267 transitions. [2024-11-10 18:16:26,179 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2024-11-10 18:16:26,179 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 192 flow. Second operand 9 states and 267 transitions. [2024-11-10 18:16:26,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 124 transitions, 659 flow [2024-11-10 18:16:26,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 124 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:16:26,187 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 369 flow [2024-11-10 18:16:26,187 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-10 18:16:26,188 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2024-11-10 18:16:26,188 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 369 flow [2024-11-10 18:16:26,189 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-10 18:16:26,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:16:26,189 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-10 18:16:26,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:16:26,389 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-10 18:16:26,391 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-10 18:16:26,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:16:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash 396738783, now seen corresponding path program 1 times [2024-11-10 18:16:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:16:26,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882764047] [2024-11-10 18:16:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:16:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:26,570 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-10 18:16:26,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:16:26,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882764047] [2024-11-10 18:16:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882764047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:16:26,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438364114] [2024-11-10 18:16:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:26,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:16:26,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:16:26,574 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-10 18:16:26,576 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-10 18:16:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:26,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 18:16:26,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:16:26,779 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-10 18:16:26,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:16:26,887 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-10 18:16:26,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438364114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:16:26,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:16:26,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-11-10 18:16:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452801001] [2024-11-10 18:16:26,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:16:26,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:16:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:16:26,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:16:26,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:16:26,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-10 18:16:26,903 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-10 18:16:26,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:16:26,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-10 18:16:26,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:16:28,225 INFO L124 PetriNetUnfolderBase]: 4419/9274 cut-off events. [2024-11-10 18:16:28,229 INFO L125 PetriNetUnfolderBase]: For 20530/20632 co-relation queries the response was YES. [2024-11-10 18:16:28,334 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-10 18:16:28,405 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 76 selfloop transitions, 30 changer transitions 30/155 dead transitions. [2024-11-10 18:16:28,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 155 transitions, 1157 flow [2024-11-10 18:16:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:16:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:16:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 267 transitions. [2024-11-10 18:16:28,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2024-11-10 18:16:28,410 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 369 flow. Second operand 9 states and 267 transitions. [2024-11-10 18:16:28,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 155 transitions, 1157 flow [2024-11-10 18:16:28,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 155 transitions, 1032 flow, removed 61 selfloop flow, removed 3 redundant places. [2024-11-10 18:16:28,439 INFO L231 Difference]: Finished difference. Result has 76 places, 83 transitions, 602 flow [2024-11-10 18:16:28,440 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-10 18:16:28,440 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2024-11-10 18:16:28,441 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 83 transitions, 602 flow [2024-11-10 18:16:28,441 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-10 18:16:28,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:16:28,441 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-10 18:16:28,461 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-10 18:16:28,642 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-10 18:16:28,643 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-10 18:16:28,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:16:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1516658787, now seen corresponding path program 2 times [2024-11-10 18:16:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:16:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168905528] [2024-11-10 18:16:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:16:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:28,751 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-10 18:16:28,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:16:28,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168905528] [2024-11-10 18:16:28,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168905528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:16:28,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:16:28,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:16:28,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978964231] [2024-11-10 18:16:28,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:16:28,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:16:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:16:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:16:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:16:28,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-10 18:16:28,761 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-10 18:16:28,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:16:28,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-10 18:16:28,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:16:30,033 INFO L124 PetriNetUnfolderBase]: 5566/10691 cut-off events. [2024-11-10 18:16:30,033 INFO L125 PetriNetUnfolderBase]: For 31158/33194 co-relation queries the response was YES. [2024-11-10 18:16:30,077 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-10 18:16:30,122 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 104 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2024-11-10 18:16:30,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 135 transitions, 1176 flow [2024-11-10 18:16:30,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:16:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:16:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-10 18:16:30,123 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2024-11-10 18:16:30,124 INFO L175 Difference]: Start difference. First operand has 76 places, 83 transitions, 602 flow. Second operand 4 states and 136 transitions. [2024-11-10 18:16:30,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 135 transitions, 1176 flow [2024-11-10 18:16:30,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 135 transitions, 1130 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-11-10 18:16:30,155 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 606 flow [2024-11-10 18:16:30,157 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-10 18:16:30,158 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2024-11-10 18:16:30,158 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 606 flow [2024-11-10 18:16:30,158 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-10 18:16:30,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:16:30,159 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-10 18:16:30,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:16:30,161 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-10 18:16:30,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:16:30,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1055416817, now seen corresponding path program 2 times [2024-11-10 18:16:30,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:16:30,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825983493] [2024-11-10 18:16:30,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:30,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:16:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:30,464 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-10 18:16:30,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:16:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825983493] [2024-11-10 18:16:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825983493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:16:30,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:16:30,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:16:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509177622] [2024-11-10 18:16:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:16:30,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:16:30,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:16:30,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:16:30,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:16:30,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-10 18:16:30,483 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-10 18:16:30,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:16:30,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-10 18:16:30,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:16:32,039 INFO L124 PetriNetUnfolderBase]: 5098/10347 cut-off events. [2024-11-10 18:16:32,039 INFO L125 PetriNetUnfolderBase]: For 30234/31389 co-relation queries the response was YES. [2024-11-10 18:16:32,093 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-10 18:16:32,117 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 91 selfloop transitions, 5 changer transitions 10/131 dead transitions. [2024-11-10 18:16:32,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 131 transitions, 1119 flow [2024-11-10 18:16:32,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:16:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:16:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-11-10 18:16:32,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6887755102040817 [2024-11-10 18:16:32,118 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 606 flow. Second operand 4 states and 135 transitions. [2024-11-10 18:16:32,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 131 transitions, 1119 flow [2024-11-10 18:16:32,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 131 transitions, 1119 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:16:32,140 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 594 flow [2024-11-10 18:16:32,140 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-10 18:16:32,141 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-11-10 18:16:32,141 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 594 flow [2024-11-10 18:16:32,141 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-10 18:16:32,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:16:32,142 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-10 18:16:32,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:16:32,142 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-10 18:16:32,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:16:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1831722161, now seen corresponding path program 1 times [2024-11-10 18:16:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:16:32,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864983506] [2024-11-10 18:16:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:32,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:16:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:32,307 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-10 18:16:32,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:16:32,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864983506] [2024-11-10 18:16:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864983506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:16:32,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780287040] [2024-11-10 18:16:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:32,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:16:32,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:16:32,311 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-10 18:16:32,312 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-10 18:16:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:32,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 18:16:32,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:16:32,515 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-10 18:16:32,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:16:32,716 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-10 18:16:32,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780287040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:16:32,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:16:32,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2024-11-10 18:16:32,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589808991] [2024-11-10 18:16:32,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:16:32,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:16:32,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:16:32,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:16:32,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:16:32,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-11-10 18:16:32,740 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-10 18:16:32,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:16:32,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-11-10 18:16:32,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:16:36,849 INFO L124 PetriNetUnfolderBase]: 12945/24870 cut-off events. [2024-11-10 18:16:36,849 INFO L125 PetriNetUnfolderBase]: For 79175/79243 co-relation queries the response was YES. [2024-11-10 18:16:37,052 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-10 18:16:37,108 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 101 selfloop transitions, 56 changer transitions 161/334 dead transitions. [2024-11-10 18:16:37,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 334 transitions, 3102 flow [2024-11-10 18:16:37,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 18:16:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-10 18:16:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 423 transitions. [2024-11-10 18:16:37,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5395408163265306 [2024-11-10 18:16:37,111 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 594 flow. Second operand 16 states and 423 transitions. [2024-11-10 18:16:37,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 334 transitions, 3102 flow [2024-11-10 18:16:37,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 334 transitions, 3074 flow, removed 14 selfloop flow, removed 0 redundant places. [2024-11-10 18:16:37,181 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 1135 flow [2024-11-10 18:16:37,181 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-10 18:16:37,181 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 58 predicate places. [2024-11-10 18:16:37,182 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 1135 flow [2024-11-10 18:16:37,182 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-10 18:16:37,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:16:37,182 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-10 18:16:37,198 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-10 18:16:37,382 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-10 18:16:37,383 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-10 18:16:37,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:16:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash 972062885, now seen corresponding path program 2 times [2024-11-10 18:16:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:16:37,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171207016] [2024-11-10 18:16:37,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:16:37,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:16:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:16:37,559 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-10 18:16:37,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:16:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171207016] [2024-11-10 18:16:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171207016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:16:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610687655] [2024-11-10 18:16:37,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:16:37,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:16:37,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:16:37,562 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-10 18:16:37,563 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-10 18:16:37,620 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:16:37,620 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:16:37,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 18:16:37,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:16:37,762 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-10 18:16:37,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:16:37,837 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-10 18:16:37,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610687655] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:16:37,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:16:37,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 12 [2024-11-10 18:16:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833197451] [2024-11-10 18:16:37,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:16:37,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:16:37,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:16:37,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:16:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:16:37,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-11-10 18:16:37,904 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-10 18:16:37,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:16:37,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-11-10 18:16:37,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:16:38,889 INFO L124 PetriNetUnfolderBase]: 2813/6869 cut-off events. [2024-11-10 18:16:38,890 INFO L125 PetriNetUnfolderBase]: For 42449/42517 co-relation queries the response was YES. [2024-11-10 18:16:38,922 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-10 18:16:38,929 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 0 selfloop transitions, 0 changer transitions 183/183 dead transitions. [2024-11-10 18:16:38,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 183 transitions, 2074 flow [2024-11-10 18:16:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:16:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:16:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions. [2024-11-10 18:16:38,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-11-10 18:16:38,931 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 1135 flow. Second operand 9 states and 243 transitions. [2024-11-10 18:16:38,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 183 transitions, 2074 flow [2024-11-10 18:16:38,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 183 transitions, 1821 flow, removed 56 selfloop flow, removed 14 redundant places. [2024-11-10 18:16:38,989 INFO L231 Difference]: Finished difference. Result has 87 places, 0 transitions, 0 flow [2024-11-10 18:16:38,989 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-10 18:16:38,990 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-10 18:16:38,990 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 0 transitions, 0 flow [2024-11-10 18:16:38,990 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-10 18:16:38,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-10 18:16:38,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-10 18:16:38,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-10 18:16:38,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-10 18:16:38,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-10 18:16:39,007 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-10 18:16:39,194 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-10 18:16:39,195 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1] [2024-11-10 18:16:39,198 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:16:39,198 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:16:39,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:16:39 BasicIcfg [2024-11-10 18:16:39,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:16:39,202 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:16:39,202 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:16:39,202 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:16:39,202 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:16:22" (3/4) ... [2024-11-10 18:16:39,204 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:16:39,207 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 18:16:39,207 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 18:16:39,207 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 18:16:39,209 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-10 18:16:39,209 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 18:16:39,209 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 18:16:39,209 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-10 18:16:39,274 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:16:39,275 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:16:39,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:16:39,275 INFO L158 Benchmark]: Toolchain (without parser) took 18100.48ms. Allocated memory was 176.2MB in the beginning and 8.6GB in the end (delta: 8.4GB). Free memory was 141.7MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 678.7MB. Max. memory is 16.1GB. [2024-11-10 18:16:39,275 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:16:39,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.61ms. Allocated memory is still 176.2MB. Free memory was 140.8MB in the beginning and 128.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 18:16:39,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.03ms. Allocated memory is still 176.2MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:16:39,276 INFO L158 Benchmark]: Boogie Preprocessor took 54.14ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:16:39,276 INFO L158 Benchmark]: IcfgBuilder took 655.90ms. Allocated memory is still 176.2MB. Free memory was 124.0MB in the beginning and 129.3MB in the end (delta: -5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 18:16:39,276 INFO L158 Benchmark]: TraceAbstraction took 16858.07ms. Allocated memory was 176.2MB in the beginning and 8.6GB in the end (delta: 8.4GB). Free memory was 128.3MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 810.9MB. Max. memory is 16.1GB. [2024-11-10 18:16:39,276 INFO L158 Benchmark]: Witness Printer took 72.85ms. Allocated memory is still 8.6GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:16:39,277 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.13ms. Allocated memory is still 109.1MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.61ms. Allocated memory is still 176.2MB. Free memory was 140.8MB in the beginning and 128.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.03ms. Allocated memory is still 176.2MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.14ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 655.90ms. Allocated memory is still 176.2MB. Free memory was 124.0MB in the beginning and 129.3MB in the end (delta: -5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16858.07ms. Allocated memory was 176.2MB in the beginning and 8.6GB in the end (delta: 8.4GB). Free memory was 128.3MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 810.9MB. Max. memory is 16.1GB. * Witness Printer took 72.85ms. Allocated memory is still 8.6GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 3.4MB). 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: 16.8s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 727 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 695 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 1.0s 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.6s 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-10 18:16:39,304 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