./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/exponential-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/exponential-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5877a70884380b10e463fa3cfc6b55a5014f8a8b2ecd81a270409b479a9f5bc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:59:32,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:59:32,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:59:32,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:59:32,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:59:32,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:59:32,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:59:32,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:59:32,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:59:32,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:59:32,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:59:32,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:59:32,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:59:32,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:59:32,624 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:59:32,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:59:32,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:59:32,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:59:32,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:59:32,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:59:32,627 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:59:32,631 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:59:32,632 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:59:32,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:59:32,632 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:59:32,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:59:32,633 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:59:32,633 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:59:32,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:59:32,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:59:32,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:59:32,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:59:32,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:59:32,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:59:32,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:59:32,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:59:32,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:59:32,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:59:32,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:59:32,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:59:32,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:59:32,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:59:32,639 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 -> c5877a70884380b10e463fa3cfc6b55a5014f8a8b2ecd81a270409b479a9f5bc [2024-11-09 10:59:32,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:59:32,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:59:32,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:59:32,969 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:59:32,969 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:59:32,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-64.i [2024-11-09 10:59:34,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:59:34,740 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:59:34,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-64.i [2024-11-09 10:59:34,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f84c573/778267d224ab490691de0a88a179cad7/FLAG8b3f56bc2 [2024-11-09 10:59:35,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f84c573/778267d224ab490691de0a88a179cad7 [2024-11-09 10:59:35,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:59:35,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:59:35,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:59:35,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:59:35,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:59:35,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6afd2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35, skipping insertion in model container [2024-11-09 10:59:35,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:59:35,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:59:35,518 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:59:35,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:59:35,610 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:59:35,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35 WrapperNode [2024-11-09 10:59:35,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:59:35,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:59:35,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:59:35,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:59:35,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,654 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 63 [2024-11-09 10:59:35,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:59:35,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:59:35,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:59:35,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:59:35,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,686 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-09 10:59:35,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:59:35,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:59:35,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:59:35,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:59:35,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (1/1) ... [2024-11-09 10:59:35,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:59:35,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:35,739 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-09 10:59:35,740 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-09 10:59:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:59:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-09 10:59:35,778 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-09 10:59:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-09 10:59:35,778 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-09 10:59:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:59:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:59:35,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:59:35,779 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:59:35,896 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:59:35,898 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:59:36,068 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:59:36,068 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:59:36,220 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:59:36,220 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:59:36,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:36 BoogieIcfgContainer [2024-11-09 10:59:36,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:59:36,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:59:36,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:59:36,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:59:36,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:59:35" (1/3) ... [2024-11-09 10:59:36,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2468e6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:59:36, skipping insertion in model container [2024-11-09 10:59:36,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:35" (2/3) ... [2024-11-09 10:59:36,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2468e6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:59:36, skipping insertion in model container [2024-11-09 10:59:36,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:36" (3/3) ... [2024-11-09 10:59:36,243 INFO L112 eAbstractionObserver]: Analyzing ICFG exponential-64.i [2024-11-09 10:59:36,284 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:59:36,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:59:36,285 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:59:36,337 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:59:36,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2024-11-09 10:59:36,408 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2024-11-09 10:59:36,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:59:36,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 6/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2024-11-09 10:59:36,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2024-11-09 10:59:36,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 57 flow [2024-11-09 10:59:36,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:59:36,438 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;@3f3655bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:59:36,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 10:59:36,446 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:59:36,450 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-09 10:59:36,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:59:36,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:36,451 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:59:36,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:36,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1813756647, now seen corresponding path program 1 times [2024-11-09 10:59:36,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:36,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777745263] [2024-11-09 10:59:36,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:36,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:36,763 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-09 10:59:36,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:36,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777745263] [2024-11-09 10:59:36,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777745263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:36,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:36,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:59:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317201671] [2024-11-09 10:59:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:36,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:59:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:36,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:59:36,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:59:36,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-11-09 10:59:36,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-09 10:59:36,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:36,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-11-09 10:59:36,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:36,887 INFO L124 PetriNetUnfolderBase]: 31/91 cut-off events. [2024-11-09 10:59:36,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:59:36,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 91 events. 31/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 350 event pairs, 13 based on Foata normal form. 8/85 useless extension candidates. Maximal degree in co-relation 150. Up to 53 conditions per place. [2024-11-09 10:59:36,892 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 14 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2024-11-09 10:59:36,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 89 flow [2024-11-09 10:59:36,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:59:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:59:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-11-09 10:59:36,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2024-11-09 10:59:36,907 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 57 flow. Second operand 3 states and 49 transitions. [2024-11-09 10:59:36,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 89 flow [2024-11-09 10:59:36,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:36,912 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 58 flow [2024-11-09 10:59:36,914 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2024-11-09 10:59:36,917 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2024-11-09 10:59:36,919 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 58 flow [2024-11-09 10:59:36,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-09 10:59:36,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:36,920 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:36,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:59:36,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:36,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:36,922 INFO L85 PathProgramCache]: Analyzing trace with hash 641854484, now seen corresponding path program 1 times [2024-11-09 10:59:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:36,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461454725] [2024-11-09 10:59:36,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:36,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:36,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:59:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:36,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:59:36,999 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:59:37,002 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-09 10:59:37,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-09 10:59:37,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2024-11-09 10:59:37,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-09 10:59:37,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:59:37,007 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 10:59:37,010 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:59:37,012 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 10:59:37,036 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:59:37,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 90 flow [2024-11-09 10:59:37,060 INFO L124 PetriNetUnfolderBase]: 9/64 cut-off events. [2024-11-09 10:59:37,063 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:59:37,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 64 events. 9/64 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 147 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 53. Up to 6 conditions per place. [2024-11-09 10:59:37,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 90 flow [2024-11-09 10:59:37,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 33 transitions, 84 flow [2024-11-09 10:59:37,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:59:37,067 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;@3f3655bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:59:37,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 10:59:37,074 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:59:37,074 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-09 10:59:37,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:59:37,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:37,075 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:59:37,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:37,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash -778335687, now seen corresponding path program 1 times [2024-11-09 10:59:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:37,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936399859] [2024-11-09 10:59:37,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:37,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:37,160 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-09 10:59:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:37,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936399859] [2024-11-09 10:59:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936399859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:37,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:37,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:59:37,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001419266] [2024-11-09 10:59:37,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:37,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:59:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:37,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:59:37,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:59:37,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-09 10:59:37,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-09 10:59:37,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:37,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-09 10:59:37,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:37,377 INFO L124 PetriNetUnfolderBase]: 283/571 cut-off events. [2024-11-09 10:59:37,378 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 10:59:37,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 571 events. 283/571 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3203 event pairs, 111 based on Foata normal form. 40/541 useless extension candidates. Maximal degree in co-relation 444. Up to 433 conditions per place. [2024-11-09 10:59:37,389 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 20 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2024-11-09 10:59:37,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 132 flow [2024-11-09 10:59:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:59:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:59:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-09 10:59:37,393 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2024-11-09 10:59:37,393 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 84 flow. Second operand 3 states and 67 transitions. [2024-11-09 10:59:37,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 132 flow [2024-11-09 10:59:37,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:37,397 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 89 flow [2024-11-09 10:59:37,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-11-09 10:59:37,398 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-11-09 10:59:37,399 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 89 flow [2024-11-09 10:59:37,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-09 10:59:37,400 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:37,400 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:37,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:59:37,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:37,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash 274581387, now seen corresponding path program 1 times [2024-11-09 10:59:37,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:37,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468734264] [2024-11-09 10:59:37,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:37,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:37,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:37,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468734264] [2024-11-09 10:59:37,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468734264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:37,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:37,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:59:37,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683146412] [2024-11-09 10:59:37,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:37,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:59:37,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:37,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:59:37,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:59:37,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-09 10:59:37,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-09 10:59:37,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:37,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-09 10:59:37,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:37,652 INFO L124 PetriNetUnfolderBase]: 319/627 cut-off events. [2024-11-09 10:59:37,653 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-09 10:59:37,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 627 events. 319/627 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3649 event pairs, 263 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 512. Up to 445 conditions per place. [2024-11-09 10:59:37,662 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 20 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2024-11-09 10:59:37,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 145 flow [2024-11-09 10:59:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:59:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:59:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2024-11-09 10:59:37,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5642857142857143 [2024-11-09 10:59:37,665 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 89 flow. Second operand 4 states and 79 transitions. [2024-11-09 10:59:37,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 145 flow [2024-11-09 10:59:37,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 143 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:37,668 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 101 flow [2024-11-09 10:59:37,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2024-11-09 10:59:37,670 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-11-09 10:59:37,671 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 101 flow [2024-11-09 10:59:37,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-09 10:59:37,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:37,672 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:37,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:59:37,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:37,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:37,673 INFO L85 PathProgramCache]: Analyzing trace with hash -78730911, now seen corresponding path program 1 times [2024-11-09 10:59:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:37,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933421946] [2024-11-09 10:59:37,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:37,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 10:59:37,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:37,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933421946] [2024-11-09 10:59:37,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933421946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:37,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:37,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:59:37,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694290359] [2024-11-09 10:59:37,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:37,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:59:37,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:37,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:59:37,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:59:37,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2024-11-09 10:59:37,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-09 10:59:37,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:37,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2024-11-09 10:59:37,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:37,830 INFO L124 PetriNetUnfolderBase]: 319/607 cut-off events. [2024-11-09 10:59:37,830 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-11-09 10:59:37,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 607 events. 319/607 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3415 event pairs, 299 based on Foata normal form. 20/569 useless extension candidates. Maximal degree in co-relation 550. Up to 501 conditions per place. [2024-11-09 10:59:37,837 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 17 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2024-11-09 10:59:37,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 137 flow [2024-11-09 10:59:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:59:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:59:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-11-09 10:59:37,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-09 10:59:37,840 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 101 flow. Second operand 3 states and 57 transitions. [2024-11-09 10:59:37,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 137 flow [2024-11-09 10:59:37,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 31 transitions, 131 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:59:37,844 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 93 flow [2024-11-09 10:59:37,844 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2024-11-09 10:59:37,845 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-11-09 10:59:37,845 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 93 flow [2024-11-09 10:59:37,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-09 10:59:37,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:37,845 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:37,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:59:37,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:37,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash -78730272, now seen corresponding path program 1 times [2024-11-09 10:59:37,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:37,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218506453] [2024-11-09 10:59:37,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:37,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:37,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:37,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218506453] [2024-11-09 10:59:37,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218506453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:37,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362886321] [2024-11-09 10:59:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:37,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:37,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:37,953 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-09 10:59:37,955 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-09 10:59:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:38,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:59:38,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:38,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:38,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362886321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:38,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:59:38,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-09 10:59:38,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100548910] [2024-11-09 10:59:38,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:38,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:59:38,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:38,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:59:38,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:59:38,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-11-09 10:59:38,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 93 flow. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 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-09 10:59:38,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:38,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-11-09 10:59:38,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:38,262 INFO L124 PetriNetUnfolderBase]: 119/247 cut-off events. [2024-11-09 10:59:38,262 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-09 10:59:38,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 247 events. 119/247 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1140 event pairs, 15 based on Foata normal form. 20/261 useless extension candidates. Maximal degree in co-relation 512. Up to 96 conditions per place. [2024-11-09 10:59:38,265 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 19 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-11-09 10:59:38,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 131 flow [2024-11-09 10:59:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:59:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:59:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-11-09 10:59:38,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-11-09 10:59:38,267 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 93 flow. Second operand 5 states and 94 transitions. [2024-11-09 10:59:38,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 131 flow [2024-11-09 10:59:38,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:38,268 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 74 flow [2024-11-09 10:59:38,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2024-11-09 10:59:38,271 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2024-11-09 10:59:38,271 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 74 flow [2024-11-09 10:59:38,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 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-09 10:59:38,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:38,272 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:38,291 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-09 10:59:38,473 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-09 10:59:38,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:38,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2014220798, now seen corresponding path program 1 times [2024-11-09 10:59:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:38,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798991365] [2024-11-09 10:59:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:38,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:38,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:59:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:38,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:59:38,499 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:59:38,499 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-09 10:59:38,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-09 10:59:38,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2024-11-09 10:59:38,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-09 10:59:38,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:59:38,500 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 10:59:38,501 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:59:38,501 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 10:59:38,521 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:59:38,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 122 flow [2024-11-09 10:59:38,529 INFO L124 PetriNetUnfolderBase]: 12/88 cut-off events. [2024-11-09 10:59:38,529 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-09 10:59:38,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 88 events. 12/88 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 212 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 85. Up to 8 conditions per place. [2024-11-09 10:59:38,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 43 transitions, 122 flow [2024-11-09 10:59:38,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 41 transitions, 115 flow [2024-11-09 10:59:38,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:59:38,532 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;@3f3655bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:59:38,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 10:59:38,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:59:38,534 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-09 10:59:38,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:59:38,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:38,534 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:59:38,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:38,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash 493752921, now seen corresponding path program 1 times [2024-11-09 10:59:38,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:38,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965349104] [2024-11-09 10:59:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:38,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:38,581 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-09 10:59:38,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:38,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965349104] [2024-11-09 10:59:38,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965349104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:38,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:38,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:59:38,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811720781] [2024-11-09 10:59:38,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:38,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:59:38,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:38,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:59:38,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:59:38,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-11-09 10:59:38,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-09 10:59:38,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:38,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-11-09 10:59:38,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:38,904 INFO L124 PetriNetUnfolderBase]: 1803/3003 cut-off events. [2024-11-09 10:59:38,905 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-11-09 10:59:38,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5722 conditions, 3003 events. 1803/3003 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18879 event pairs, 1385 based on Foata normal form. 168/2846 useless extension candidates. Maximal degree in co-relation 2516. Up to 2465 conditions per place. [2024-11-09 10:59:38,933 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2024-11-09 10:59:38,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 171 flow [2024-11-09 10:59:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:59:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:59:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-09 10:59:38,935 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2024-11-09 10:59:38,935 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 115 flow. Second operand 3 states and 83 transitions. [2024-11-09 10:59:38,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 171 flow [2024-11-09 10:59:38,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 166 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:38,941 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 116 flow [2024-11-09 10:59:38,941 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2024-11-09 10:59:38,943 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-11-09 10:59:38,944 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 116 flow [2024-11-09 10:59:38,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-09 10:59:38,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:38,945 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:38,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:59:38,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:38,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash -281942685, now seen corresponding path program 1 times [2024-11-09 10:59:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:38,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638783490] [2024-11-09 10:59:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:38,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:38,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638783490] [2024-11-09 10:59:38,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638783490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:38,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:38,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:59:38,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171283703] [2024-11-09 10:59:38,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:39,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:59:39,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:59:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:59:39,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-11-09 10:59:39,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-09 10:59:39,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:39,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-11-09 10:59:39,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:39,342 INFO L124 PetriNetUnfolderBase]: 2031/3315 cut-off events. [2024-11-09 10:59:39,342 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2024-11-09 10:59:39,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6472 conditions, 3315 events. 2031/3315 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 20932 event pairs, 1719 based on Foata normal form. 0/3106 useless extension candidates. Maximal degree in co-relation 2848. Up to 2477 conditions per place. [2024-11-09 10:59:39,378 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 26 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2024-11-09 10:59:39,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 188 flow [2024-11-09 10:59:39,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:59:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:59:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-11-09 10:59:39,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5872093023255814 [2024-11-09 10:59:39,380 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 116 flow. Second operand 4 states and 101 transitions. [2024-11-09 10:59:39,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 188 flow [2024-11-09 10:59:39,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:39,383 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 128 flow [2024-11-09 10:59:39,383 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-11-09 10:59:39,384 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2024-11-09 10:59:39,384 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 128 flow [2024-11-09 10:59:39,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-09 10:59:39,385 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:39,385 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:39,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:59:39,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:39,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash -151107916, now seen corresponding path program 1 times [2024-11-09 10:59:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:39,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881654414] [2024-11-09 10:59:39,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:39,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 10:59:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881654414] [2024-11-09 10:59:39,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881654414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:39,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:39,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:59:39,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859789244] [2024-11-09 10:59:39,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:39,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:59:39,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:39,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:59:39,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:59:39,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-11-09 10:59:39,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-09 10:59:39,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:39,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-11-09 10:59:39,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:39,719 INFO L124 PetriNetUnfolderBase]: 2031/3231 cut-off events. [2024-11-09 10:59:39,719 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2024-11-09 10:59:39,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6806 conditions, 3231 events. 2031/3231 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 19902 event pairs, 1947 based on Foata normal form. 84/3066 useless extension candidates. Maximal degree in co-relation 3014. Up to 2789 conditions per place. [2024-11-09 10:59:39,755 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 21 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-09 10:59:39,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 39 transitions, 172 flow [2024-11-09 10:59:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:59:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:59:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-09 10:59:39,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5658914728682171 [2024-11-09 10:59:39,757 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 128 flow. Second operand 3 states and 73 transitions. [2024-11-09 10:59:39,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 39 transitions, 172 flow [2024-11-09 10:59:39,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 39 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:59:39,766 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 120 flow [2024-11-09 10:59:39,766 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2024-11-09 10:59:39,767 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-11-09 10:59:39,767 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 120 flow [2024-11-09 10:59:39,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-09 10:59:39,767 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:39,767 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:39,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:59:39,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:39,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash -151107277, now seen corresponding path program 1 times [2024-11-09 10:59:39,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:39,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162002217] [2024-11-09 10:59:39,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:39,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:39,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:39,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162002217] [2024-11-09 10:59:39,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162002217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:39,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704242506] [2024-11-09 10:59:39,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:39,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:39,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:39,816 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-09 10:59:39,817 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-09 10:59:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:39,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:59:39,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:39,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:39,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704242506] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:39,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:59:39,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-09 10:59:39,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803389397] [2024-11-09 10:59:39,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:39,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:59:39,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:39,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:59:39,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:59:39,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-11-09 10:59:39,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 120 flow. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-09 10:59:39,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:39,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-11-09 10:59:39,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:40,124 INFO L124 PetriNetUnfolderBase]: 807/1335 cut-off events. [2024-11-09 10:59:40,125 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2024-11-09 10:59:40,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 1335 events. 807/1335 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7307 event pairs, 135 based on Foata normal form. 84/1374 useless extension candidates. Maximal degree in co-relation 2752. Up to 528 conditions per place. [2024-11-09 10:59:40,137 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 31 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-11-09 10:59:40,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 204 flow [2024-11-09 10:59:40,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:59:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:59:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-09 10:59:40,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5658914728682171 [2024-11-09 10:59:40,139 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 120 flow. Second operand 6 states and 146 transitions. [2024-11-09 10:59:40,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 204 flow [2024-11-09 10:59:40,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:40,143 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 107 flow [2024-11-09 10:59:40,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2024-11-09 10:59:40,144 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-09 10:59:40,146 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 107 flow [2024-11-09 10:59:40,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-09 10:59:40,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:40,146 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:40,164 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-09 10:59:40,347 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,SelfDestructingSolverStorable10 [2024-11-09 10:59:40,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:40,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:40,348 INFO L85 PathProgramCache]: Analyzing trace with hash 214581830, now seen corresponding path program 1 times [2024-11-09 10:59:40,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:40,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260168925] [2024-11-09 10:59:40,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:40,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:59:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:40,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:59:40,374 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:59:40,374 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-09 10:59:40,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-09 10:59:40,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2024-11-09 10:59:40,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-09 10:59:40,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:59:40,375 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 10:59:40,376 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:59:40,376 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-09 10:59:40,411 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:59:40,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 51 transitions, 158 flow [2024-11-09 10:59:40,427 INFO L124 PetriNetUnfolderBase]: 15/112 cut-off events. [2024-11-09 10:59:40,427 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-09 10:59:40,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 112 events. 15/112 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 119. Up to 10 conditions per place. [2024-11-09 10:59:40,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 51 transitions, 158 flow [2024-11-09 10:59:40,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 49 transitions, 150 flow [2024-11-09 10:59:40,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:59:40,432 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;@3f3655bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:59:40,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 10:59:40,434 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:59:40,435 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-09 10:59:40,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:59:40,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:40,435 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:59:40,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2002509177, now seen corresponding path program 1 times [2024-11-09 10:59:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854013337] [2024-11-09 10:59:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:40,475 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-09 10:59:40,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:40,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854013337] [2024-11-09 10:59:40,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854013337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:40,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:40,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:59:40,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063305847] [2024-11-09 10:59:40,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:40,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:59:40,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:40,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:59:40,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:59:40,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-11-09 10:59:40,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 10:59:40,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:40,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-11-09 10:59:40,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:41,985 INFO L124 PetriNetUnfolderBase]: 9931/14779 cut-off events. [2024-11-09 10:59:41,985 INFO L125 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2024-11-09 10:59:42,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28636 conditions, 14779 events. 9931/14779 cut-off events. For 2844/2844 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 98366 event pairs, 8233 based on Foata normal form. 680/14101 useless extension candidates. Maximal degree in co-relation 12948. Up to 12641 conditions per place. [2024-11-09 10:59:42,169 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 28 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-11-09 10:59:42,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 51 transitions, 214 flow [2024-11-09 10:59:42,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:59:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:59:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-09 10:59:42,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2024-11-09 10:59:42,170 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 150 flow. Second operand 3 states and 99 transitions. [2024-11-09 10:59:42,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 51 transitions, 214 flow [2024-11-09 10:59:42,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 51 transitions, 201 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:42,185 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 143 flow [2024-11-09 10:59:42,185 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2024-11-09 10:59:42,187 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2024-11-09 10:59:42,187 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 143 flow [2024-11-09 10:59:42,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 10:59:42,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:42,188 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:42,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:59:42,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:42,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1376707005, now seen corresponding path program 1 times [2024-11-09 10:59:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:42,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512835064] [2024-11-09 10:59:42,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:42,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512835064] [2024-11-09 10:59:42,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512835064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:42,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:42,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:59:42,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440134063] [2024-11-09 10:59:42,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:42,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:59:42,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:42,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:59:42,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:59:42,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-11-09 10:59:42,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-09 10:59:42,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:42,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-11-09 10:59:42,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:44,123 INFO L124 PetriNetUnfolderBase]: 11183/16371 cut-off events. [2024-11-09 10:59:44,124 INFO L125 PetriNetUnfolderBase]: For 1830/1830 co-relation queries the response was YES. [2024-11-09 10:59:44,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32074 conditions, 16371 events. 11183/16371 cut-off events. For 1830/1830 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 108062 event pairs, 9591 based on Foata normal form. 0/15521 useless extension candidates. Maximal degree in co-relation 14496. Up to 12653 conditions per place. [2024-11-09 10:59:44,295 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 32 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2024-11-09 10:59:44,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 56 transitions, 231 flow [2024-11-09 10:59:44,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:59:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:59:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2024-11-09 10:59:44,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2024-11-09 10:59:44,298 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 143 flow. Second operand 4 states and 123 transitions. [2024-11-09 10:59:44,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 56 transitions, 231 flow [2024-11-09 10:59:44,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 56 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:44,305 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 155 flow [2024-11-09 10:59:44,306 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2024-11-09 10:59:44,307 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 4 predicate places. [2024-11-09 10:59:44,307 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 155 flow [2024-11-09 10:59:44,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-09 10:59:44,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:44,307 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:44,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:59:44,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:44,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:44,308 INFO L85 PathProgramCache]: Analyzing trace with hash 270936583, now seen corresponding path program 1 times [2024-11-09 10:59:44,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:44,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472042533] [2024-11-09 10:59:44,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:44,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 10:59:44,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:44,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472042533] [2024-11-09 10:59:44,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472042533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:44,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:44,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:59:44,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020584310] [2024-11-09 10:59:44,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:44,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:59:44,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:44,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:59:44,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:59:44,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2024-11-09 10:59:44,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-09 10:59:44,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:44,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2024-11-09 10:59:44,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:46,046 INFO L124 PetriNetUnfolderBase]: 11183/16031 cut-off events. [2024-11-09 10:59:46,047 INFO L125 PetriNetUnfolderBase]: For 2170/2170 co-relation queries the response was YES. [2024-11-09 10:59:46,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33432 conditions, 16031 events. 11183/16031 cut-off events. For 2170/2170 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 102274 event pairs, 10843 based on Foata normal form. 340/15353 useless extension candidates. Maximal degree in co-relation 15174. Up to 14245 conditions per place. [2024-11-09 10:59:46,209 INFO L140 encePairwiseOnDemand]: 49/51 looper letters, 25 selfloop transitions, 1 changer transitions 1/47 dead transitions. [2024-11-09 10:59:46,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 47 transitions, 207 flow [2024-11-09 10:59:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:59:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:59:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-09 10:59:46,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5816993464052288 [2024-11-09 10:59:46,211 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 155 flow. Second operand 3 states and 89 transitions. [2024-11-09 10:59:46,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 47 transitions, 207 flow [2024-11-09 10:59:46,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 47 transitions, 201 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:59:46,271 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 147 flow [2024-11-09 10:59:46,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2024-11-09 10:59:46,273 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2024-11-09 10:59:46,274 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 147 flow [2024-11-09 10:59:46,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-09 10:59:46,274 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:46,274 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:46,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:59:46,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:46,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash 270937222, now seen corresponding path program 1 times [2024-11-09 10:59:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346514866] [2024-11-09 10:59:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:46,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:46,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346514866] [2024-11-09 10:59:46,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346514866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:46,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234073183] [2024-11-09 10:59:46,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:46,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:46,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:46,339 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-09 10:59:46,341 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-09 10:59:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:46,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:59:46,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:46,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234073183] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:46,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:59:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-09 10:59:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895857431] [2024-11-09 10:59:46,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:46,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:59:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:59:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:59:46,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2024-11-09 10:59:46,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 147 flow. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 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-09 10:59:46,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:46,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2024-11-09 10:59:46,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:47,644 INFO L124 PetriNetUnfolderBase]: 8935/12855 cut-off events. [2024-11-09 10:59:47,645 INFO L125 PetriNetUnfolderBase]: For 1926/1926 co-relation queries the response was YES. [2024-11-09 10:59:47,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26316 conditions, 12855 events. 8935/12855 cut-off events. For 1926/1926 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 78720 event pairs, 927 based on Foata normal form. 84/12593 useless extension candidates. Maximal degree in co-relation 26300. Up to 6657 conditions per place. [2024-11-09 10:59:47,738 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 49 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2024-11-09 10:59:47,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 75 transitions, 319 flow [2024-11-09 10:59:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:59:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:59:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-11-09 10:59:47,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2024-11-09 10:59:47,739 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 147 flow. Second operand 6 states and 189 transitions. [2024-11-09 10:59:47,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 75 transitions, 319 flow [2024-11-09 10:59:47,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:47,761 INFO L231 Difference]: Finished difference. Result has 74 places, 49 transitions, 186 flow [2024-11-09 10:59:47,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=74, PETRI_TRANSITIONS=49} [2024-11-09 10:59:47,762 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 10 predicate places. [2024-11-09 10:59:47,762 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 49 transitions, 186 flow [2024-11-09 10:59:47,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 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-09 10:59:47,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:47,763 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:47,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:59:47,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:47,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:47,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1912241560, now seen corresponding path program 1 times [2024-11-09 10:59:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:47,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637146814] [2024-11-09 10:59:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:47,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:47,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:59:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:47,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:59:47,992 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:59:47,992 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-09 10:59:47,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-09 10:59:47,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2024-11-09 10:59:47,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-09 10:59:47,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:59:47,993 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 10:59:47,994 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:59:47,994 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-09 10:59:48,017 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:59:48,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 59 transitions, 198 flow [2024-11-09 10:59:48,027 INFO L124 PetriNetUnfolderBase]: 18/136 cut-off events. [2024-11-09 10:59:48,027 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-11-09 10:59:48,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 136 events. 18/136 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 359 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 155. Up to 12 conditions per place. [2024-11-09 10:59:48,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 59 transitions, 198 flow [2024-11-09 10:59:48,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 57 transitions, 189 flow [2024-11-09 10:59:48,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:59:48,030 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;@3f3655bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:59:48,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 10:59:48,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:59:48,031 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-09 10:59:48,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:59:48,031 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:48,031 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:59:48,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:48,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:48,032 INFO L85 PathProgramCache]: Analyzing trace with hash -547034215, now seen corresponding path program 1 times [2024-11-09 10:59:48,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:48,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586715242] [2024-11-09 10:59:48,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:48,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:48,052 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-09 10:59:48,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:48,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586715242] [2024-11-09 10:59:48,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586715242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:48,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:48,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:59:48,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246617588] [2024-11-09 10:59:48,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:48,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:59:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:48,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:59:48,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:59:48,054 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-11-09 10:59:48,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-09 10:59:48,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:48,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-11-09 10:59:48,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:54,103 INFO L124 PetriNetUnfolderBase]: 50635/70075 cut-off events. [2024-11-09 10:59:54,103 INFO L125 PetriNetUnfolderBase]: For 19228/19228 co-relation queries the response was YES. [2024-11-09 10:59:54,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137438 conditions, 70075 events. 50635/70075 cut-off events. For 19228/19228 co-relation queries the response was YES. Maximal size of possible extension queue 2636. Compared 480250 event pairs, 38367 based on Foata normal form. 2728/67353 useless extension candidates. Maximal degree in co-relation 63252. Up to 61537 conditions per place. [2024-11-09 10:59:54,820 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-11-09 10:59:54,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 59 transitions, 261 flow [2024-11-09 10:59:54,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:59:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:59:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-11-09 10:59:54,821 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6497175141242938 [2024-11-09 10:59:54,821 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 189 flow. Second operand 3 states and 115 transitions. [2024-11-09 10:59:54,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 59 transitions, 261 flow [2024-11-09 10:59:54,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 59 transitions, 236 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:54,890 INFO L231 Difference]: Finished difference. Result has 77 places, 55 transitions, 170 flow [2024-11-09 10:59:54,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=77, PETRI_TRANSITIONS=55} [2024-11-09 10:59:54,891 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, 1 predicate places. [2024-11-09 10:59:54,891 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 170 flow [2024-11-09 10:59:54,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-09 10:59:54,891 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:54,891 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:54,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:59:54,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 10:59:54,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1285255723, now seen corresponding path program 1 times [2024-11-09 10:59:54,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:54,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970188670] [2024-11-09 10:59:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:54,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:59:54,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:54,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970188670] [2024-11-09 10:59:54,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970188670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:54,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:54,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:59:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769465701] [2024-11-09 10:59:54,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:54,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:59:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:54,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:59:54,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:59:54,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-11-09 10:59:54,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 55 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-09 10:59:54,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:54,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-11-09 10:59:54,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:01,753 INFO L124 PetriNetUnfolderBase]: 57007/77811 cut-off events. [2024-11-09 11:00:01,753 INFO L125 PetriNetUnfolderBase]: For 11430/11430 co-relation queries the response was YES. [2024-11-09 11:00:02,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152908 conditions, 77811 events. 57007/77811 cut-off events. For 11430/11430 co-relation queries the response was YES. Maximal size of possible extension queue 2864. Compared 528096 event pairs, 40519 based on Foata normal form. 0/74401 useless extension candidates. Maximal degree in co-relation 70304. Up to 61549 conditions per place. [2024-11-09 11:00:02,575 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 38 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-11-09 11:00:02,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 66 transitions, 274 flow [2024-11-09 11:00:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:00:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 11:00:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2024-11-09 11:00:02,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.614406779661017 [2024-11-09 11:00:02,577 INFO L175 Difference]: Start difference. First operand has 77 places, 55 transitions, 170 flow. Second operand 4 states and 145 transitions. [2024-11-09 11:00:02,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 66 transitions, 274 flow [2024-11-09 11:00:02,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 66 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 11:00:02,607 INFO L231 Difference]: Finished difference. Result has 80 places, 56 transitions, 182 flow [2024-11-09 11:00:02,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=80, PETRI_TRANSITIONS=56} [2024-11-09 11:00:02,608 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, 4 predicate places. [2024-11-09 11:00:02,608 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 56 transitions, 182 flow [2024-11-09 11:00:02,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-09 11:00:02,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:02,608 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:02,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 11:00:02,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 11:00:02,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:02,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1187402586, now seen corresponding path program 1 times [2024-11-09 11:00:02,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:00:02,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695434335] [2024-11-09 11:00:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:00:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 11:00:02,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:00:02,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695434335] [2024-11-09 11:00:02,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695434335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:00:02,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:00:02,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 11:00:02,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75035750] [2024-11-09 11:00:02,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:00:02,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:00:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:00:02,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:00:02,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:00:02,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-11-09 11:00:02,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 56 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-09 11:00:02,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:02,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-11-09 11:00:02,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:09,451 INFO L124 PetriNetUnfolderBase]: 57007/76447 cut-off events. [2024-11-09 11:00:09,452 INFO L125 PetriNetUnfolderBase]: For 12794/12794 co-relation queries the response was YES. [2024-11-09 11:00:10,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158362 conditions, 76447 events. 57007/76447 cut-off events. For 12794/12794 co-relation queries the response was YES. Maximal size of possible extension queue 2793. Compared 496352 event pairs, 55643 based on Foata normal form. 1364/73721 useless extension candidates. Maximal degree in co-relation 73030. Up to 69285 conditions per place. [2024-11-09 11:00:10,404 INFO L140 encePairwiseOnDemand]: 57/59 looper letters, 29 selfloop transitions, 1 changer transitions 1/55 dead transitions. [2024-11-09 11:00:10,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 55 transitions, 242 flow [2024-11-09 11:00:10,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:00:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 11:00:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-11-09 11:00:10,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5932203389830508 [2024-11-09 11:00:10,406 INFO L175 Difference]: Start difference. First operand has 80 places, 56 transitions, 182 flow. Second operand 3 states and 105 transitions. [2024-11-09 11:00:10,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 55 transitions, 242 flow [2024-11-09 11:00:11,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 55 transitions, 236 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 11:00:11,266 INFO L231 Difference]: Finished difference. Result has 79 places, 54 transitions, 174 flow [2024-11-09 11:00:11,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=79, PETRI_TRANSITIONS=54} [2024-11-09 11:00:11,266 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, 3 predicate places. [2024-11-09 11:00:11,266 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 54 transitions, 174 flow [2024-11-09 11:00:11,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-09 11:00:11,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:11,267 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:11,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 11:00:11,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 11:00:11,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1187403225, now seen corresponding path program 1 times [2024-11-09 11:00:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:00:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749005809] [2024-11-09 11:00:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:00:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:00:11,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:00:11,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749005809] [2024-11-09 11:00:11,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749005809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:00:11,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819372021] [2024-11-09 11:00:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:11,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:00:11,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:00:11,330 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-09 11:00:11,331 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-09 11:00:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:11,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:00:11,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:00:11,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:00:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:00:11,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819372021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:00:11,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:00:11,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-09 11:00:11,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805833291] [2024-11-09 11:00:11,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:00:11,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 11:00:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:00:11,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 11:00:11,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:00:11,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-11-09 11:00:11,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 54 transitions, 174 flow. Second operand has 8 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 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-09 11:00:11,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:11,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-11-09 11:00:11,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:16,344 INFO L124 PetriNetUnfolderBase]: 49639/67127 cut-off events. [2024-11-09 11:00:16,344 INFO L125 PetriNetUnfolderBase]: For 13356/13356 co-relation queries the response was YES. [2024-11-09 11:00:16,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136910 conditions, 67127 events. 49639/67127 cut-off events. For 13356/13356 co-relation queries the response was YES. Maximal size of possible extension queue 2468. Compared 435952 event pairs, 8337 based on Foata normal form. 84/64225 useless extension candidates. Maximal degree in co-relation 136892. Up to 38401 conditions per place. [2024-11-09 11:00:16,992 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 55 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2024-11-09 11:00:16,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 85 transitions, 362 flow [2024-11-09 11:00:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:00:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 11:00:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2024-11-09 11:00:16,994 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6186440677966102 [2024-11-09 11:00:16,994 INFO L175 Difference]: Start difference. First operand has 79 places, 54 transitions, 174 flow. Second operand 6 states and 219 transitions. [2024-11-09 11:00:16,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 85 transitions, 362 flow [2024-11-09 11:00:17,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 85 transitions, 361 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 11:00:17,518 INFO L231 Difference]: Finished difference. Result has 86 places, 57 transitions, 213 flow [2024-11-09 11:00:17,518 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=86, PETRI_TRANSITIONS=57} [2024-11-09 11:00:17,519 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, 10 predicate places. [2024-11-09 11:00:17,519 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 57 transitions, 213 flow [2024-11-09 11:00:17,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 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-09 11:00:17,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:17,520 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:17,542 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-09 11:00:17,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:00:17,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 11:00:17,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:17,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1416873895, now seen corresponding path program 1 times [2024-11-09 11:00:17,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:00:17,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038110281] [2024-11-09 11:00:17,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:17,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:00:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:00:17,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:00:17,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038110281] [2024-11-09 11:00:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038110281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:00:17,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572711463] [2024-11-09 11:00:17,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:17,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:00:17,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:00:17,831 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:00:17,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:00:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:17,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:00:17,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:00:18,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:00:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:00:18,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572711463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:00:18,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:00:18,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-09 11:00:18,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101776843] [2024-11-09 11:00:18,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:00:18,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 11:00:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:00:18,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 11:00:18,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=142, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:00:18,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-11-09 11:00:18,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 57 transitions, 213 flow. Second operand has 17 states, 17 states have (on average 30.058823529411764) internal successors, (511), 17 states have internal predecessors, (511), 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-09 11:00:18,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:18,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-11-09 11:00:18,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:20,104 INFO L124 PetriNetUnfolderBase]: 23783/32311 cut-off events. [2024-11-09 11:00:20,105 INFO L125 PetriNetUnfolderBase]: For 20766/20766 co-relation queries the response was YES. [2024-11-09 11:00:20,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71372 conditions, 32311 events. 23783/32311 cut-off events. For 20766/20766 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 196583 event pairs, 1383 based on Foata normal form. 1280/33155 useless extension candidates. Maximal degree in co-relation 71355. Up to 13568 conditions per place. [2024-11-09 11:00:20,802 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 61 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2024-11-09 11:00:20,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 411 flow [2024-11-09 11:00:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:00:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 11:00:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 277 transitions. [2024-11-09 11:00:20,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.586864406779661 [2024-11-09 11:00:20,804 INFO L175 Difference]: Start difference. First operand has 86 places, 57 transitions, 213 flow. Second operand 8 states and 277 transitions. [2024-11-09 11:00:20,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 411 flow [2024-11-09 11:00:20,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 88 transitions, 390 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-09 11:00:20,840 INFO L231 Difference]: Finished difference. Result has 81 places, 50 transitions, 183 flow [2024-11-09 11:00:20,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=183, PETRI_PLACES=81, PETRI_TRANSITIONS=50} [2024-11-09 11:00:20,841 INFO L277 CegarLoopForPetriNet]: 76 programPoint places, 5 predicate places. [2024-11-09 11:00:20,841 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 50 transitions, 183 flow [2024-11-09 11:00:20,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 30.058823529411764) internal successors, (511), 17 states have internal predecessors, (511), 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-09 11:00:20,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:20,842 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:20,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 11:00:21,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 11:00:21,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 11:00:21,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:21,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1821035128, now seen corresponding path program 1 times [2024-11-09 11:00:21,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:00:21,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762584926] [2024-11-09 11:00:21,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:21,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:00:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:00:21,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 11:00:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:00:21,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 11:00:21,090 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 11:00:21,091 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-09 11:00:21,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-09 11:00:21,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2024-11-09 11:00:21,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-09 11:00:21,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 11:00:21,092 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 11:00:21,092 WARN L244 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 11:00:21,092 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-09 11:00:21,119 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 11:00:21,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 67 transitions, 242 flow [2024-11-09 11:00:21,130 INFO L124 PetriNetUnfolderBase]: 21/160 cut-off events. [2024-11-09 11:00:21,130 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-09 11:00:21,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 160 events. 21/160 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 423 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 193. Up to 14 conditions per place. [2024-11-09 11:00:21,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 67 transitions, 242 flow [2024-11-09 11:00:21,131 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 65 transitions, 232 flow [2024-11-09 11:00:21,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:00:21,132 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;@3f3655bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:00:21,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:00:21,134 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 11:00:21,134 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-09 11:00:21,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 11:00:21,134 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:21,134 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:00:21,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 11:00:21,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:21,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1435057337, now seen corresponding path program 1 times [2024-11-09 11:00:21,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:00:21,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104657788] [2024-11-09 11:00:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:21,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:00:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:21,155 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-09 11:00:21,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:00:21,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104657788] [2024-11-09 11:00:21,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104657788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:00:21,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:00:21,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:00:21,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996875051] [2024-11-09 11:00:21,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:00:21,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:00:21,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:00:21,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:00:21,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:00:21,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 67 [2024-11-09 11:00:21,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 65 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-09 11:00:21,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:21,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 67 [2024-11-09 11:00:21,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand