./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/test-easy10.wvr.c --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/weaver/test-easy10.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 24421fae56d27ddfd314bb85e4431c40a1e6738a845aa97472d8668d2b4dde52 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:56:57,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:56:57,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:56:57,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:56:57,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:56:57,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:56:57,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:56:57,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:56:57,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:56:57,243 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:56:57,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:56:57,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:56:57,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:56:57,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:56:57,245 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:56:57,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:56:57,245 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:56:57,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:56:57,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:56:57,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:56:57,247 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:56:57,252 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:56:57,252 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:56:57,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:56:57,253 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:56:57,253 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:56:57,253 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:56:57,253 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:56:57,254 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:56:57,254 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:56:57,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:56:57,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:56:57,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:56:57,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:56:57,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:56:57,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:56:57,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:56:57,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:56:57,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:56:57,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:56:57,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:56:57,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:56:57,262 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 -> 24421fae56d27ddfd314bb85e4431c40a1e6738a845aa97472d8668d2b4dde52 [2024-11-09 10:56:57,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:56:57,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:56:57,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:56:57,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:56:57,525 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:56:57,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy10.wvr.c [2024-11-09 10:56:58,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:56:59,151 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:56:59,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy10.wvr.c [2024-11-09 10:56:59,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c849b94c/63e9a4c863234faaa9b4ba989a019f32/FLAG5184021d2 [2024-11-09 10:56:59,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c849b94c/63e9a4c863234faaa9b4ba989a019f32 [2024-11-09 10:56:59,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:56:59,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:56:59,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:56:59,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:56:59,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:56:59,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:56:59,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0d682f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59, skipping insertion in model container [2024-11-09 10:56:59,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:56:59,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:56:59,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:56:59,866 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:56:59,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:56:59,921 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:56:59,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59 WrapperNode [2024-11-09 10:56:59,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:56:59,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:56:59,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:56:59,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:56:59,930 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:56:59" (1/1) ... [2024-11-09 10:56:59,943 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:56:59" (1/1) ... [2024-11-09 10:56:59,973 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 149 [2024-11-09 10:56:59,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:56:59,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:56:59,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:56:59,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:56:59,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:56:59,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:56:59,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:57:00,009 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:57:00,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:57:00,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:57:00,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:57:00,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:57:00,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:57:00,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:57:00,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:57:00,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:57:00,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:57:00,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:57:00,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59" (1/1) ... [2024-11-09 10:57:00,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:57:00,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:57:00,062 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:57:00,064 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:57:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:57:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:57:00,113 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:57:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:57:00,114 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:57:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 10:57:00,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 10:57:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-09 10:57:00,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-09 10:57:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:57:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:57:00,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:57:00,117 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:57:00,198 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:57:00,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:57:00,413 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:57:00,413 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:57:00,549 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:57:00,550 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:57:00,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:57:00 BoogieIcfgContainer [2024-11-09 10:57:00,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:57:00,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:57:00,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:57:00,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:57:00,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:56:59" (1/3) ... [2024-11-09 10:57:00,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f99dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:57:00, skipping insertion in model container [2024-11-09 10:57:00,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:56:59" (2/3) ... [2024-11-09 10:57:00,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f99dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:57:00, skipping insertion in model container [2024-11-09 10:57:00,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:57:00" (3/3) ... [2024-11-09 10:57:00,560 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy10.wvr.c [2024-11-09 10:57:00,574 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:57:00,574 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:57:00,574 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:57:00,645 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 10:57:00,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 62 transitions, 152 flow [2024-11-09 10:57:00,752 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2024-11-09 10:57:00,752 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:57:00,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 0/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-11-09 10:57:00,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 62 transitions, 152 flow [2024-11-09 10:57:00,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 57 transitions, 138 flow [2024-11-09 10:57:00,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:57:00,788 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;@1e24cb80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:57:00,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 10:57:00,808 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:57:00,808 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2024-11-09 10:57:00,808 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:57:00,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:57:00,809 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:57:00,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:57:00,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:57:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash 18254776, now seen corresponding path program 1 times [2024-11-09 10:57:00,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:57:00,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204947310] [2024-11-09 10:57:00,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:57:00,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:57:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:57:01,431 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:57:01,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:57:01,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204947310] [2024-11-09 10:57:01,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204947310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:57:01,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:57:01,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:57:01,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584881051] [2024-11-09 10:57:01,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:57:01,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:57:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:57:01,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:57:01,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:57:01,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 62 [2024-11-09 10:57:01,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:01,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:57:01,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 62 [2024-11-09 10:57:01,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:57:01,841 INFO L124 PetriNetUnfolderBase]: 597/1169 cut-off events. [2024-11-09 10:57:01,841 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-11-09 10:57:01,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 1169 events. 597/1169 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7091 event pairs, 424 based on Foata normal form. 26/1149 useless extension candidates. Maximal degree in co-relation 2104. Up to 853 conditions per place. [2024-11-09 10:57:01,860 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 34 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-09 10:57:01,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 230 flow [2024-11-09 10:57:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:57:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:57:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2024-11-09 10:57:01,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7365591397849462 [2024-11-09 10:57:01,876 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 138 flow. Second operand 3 states and 137 transitions. [2024-11-09 10:57:01,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 230 flow [2024-11-09 10:57:01,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 210 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 10:57:01,886 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 126 flow [2024-11-09 10:57:01,889 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2024-11-09 10:57:01,894 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2024-11-09 10:57:01,895 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 126 flow [2024-11-09 10:57:01,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:01,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:57:01,896 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:57:01,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:57:01,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:57:01,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:57:01,897 INFO L85 PathProgramCache]: Analyzing trace with hash -380765308, now seen corresponding path program 2 times [2024-11-09 10:57:01,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:57:01,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984548453] [2024-11-09 10:57:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:57:01,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:57:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:57:02,178 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:57:02,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:57:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984548453] [2024-11-09 10:57:02,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984548453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:57:02,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:57:02,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:57:02,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131366146] [2024-11-09 10:57:02,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:57:02,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:57:02,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:57:02,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:57:02,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:57:02,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 62 [2024-11-09 10:57:02,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:02,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:57:02,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 62 [2024-11-09 10:57:02,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:57:02,384 INFO L124 PetriNetUnfolderBase]: 633/1239 cut-off events. [2024-11-09 10:57:02,384 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-09 10:57:02,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2338 conditions, 1239 events. 633/1239 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7515 event pairs, 156 based on Foata normal form. 9/1203 useless extension candidates. Maximal degree in co-relation 2305. Up to 825 conditions per place. [2024-11-09 10:57:02,400 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 34 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-09 10:57:02,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 221 flow [2024-11-09 10:57:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:57:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:57:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2024-11-09 10:57:02,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7311827956989247 [2024-11-09 10:57:02,404 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 126 flow. Second operand 3 states and 136 transitions. [2024-11-09 10:57:02,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 221 flow [2024-11-09 10:57:02,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:57:02,409 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 130 flow [2024-11-09 10:57:02,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-11-09 10:57:02,410 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, -6 predicate places. [2024-11-09 10:57:02,410 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 130 flow [2024-11-09 10:57:02,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:02,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:57:02,411 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:57:02,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:57:02,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:57:02,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:57:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1891291960, now seen corresponding path program 3 times [2024-11-09 10:57:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:57:02,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530320786] [2024-11-09 10:57:02,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:57:02,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:57:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:57:02,605 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:57:02,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:57:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530320786] [2024-11-09 10:57:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530320786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:57:02,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:57:02,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:57:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987023015] [2024-11-09 10:57:02,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:57:02,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:57:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:57:02,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:57:02,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:57:02,611 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 62 [2024-11-09 10:57:02,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:02,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:57:02,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 62 [2024-11-09 10:57:02,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:57:02,767 INFO L124 PetriNetUnfolderBase]: 507/1023 cut-off events. [2024-11-09 10:57:02,767 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-11-09 10:57:02,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 1023 events. 507/1023 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5933 event pairs, 156 based on Foata normal form. 19/993 useless extension candidates. Maximal degree in co-relation 1284. Up to 645 conditions per place. [2024-11-09 10:57:02,775 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-11-09 10:57:02,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 216 flow [2024-11-09 10:57:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:57:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:57:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2024-11-09 10:57:02,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7204301075268817 [2024-11-09 10:57:02,778 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 130 flow. Second operand 3 states and 134 transitions. [2024-11-09 10:57:02,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 216 flow [2024-11-09 10:57:02,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:57:02,781 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 134 flow [2024-11-09 10:57:02,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-11-09 10:57:02,783 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, -5 predicate places. [2024-11-09 10:57:02,783 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 134 flow [2024-11-09 10:57:02,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:02,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:57:02,783 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:57:02,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:57:02,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:57:02,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:57:02,785 INFO L85 PathProgramCache]: Analyzing trace with hash 20009784, now seen corresponding path program 4 times [2024-11-09 10:57:02,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:57:02,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221193019] [2024-11-09 10:57:02,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:57:02,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:57:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:57:04,911 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:57:04,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:57:04,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221193019] [2024-11-09 10:57:04,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221193019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:57:04,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:57:04,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:57:04,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627584061] [2024-11-09 10:57:04,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:57:04,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:57:04,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:57:04,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:57:04,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:57:05,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-09 10:57:05,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 134 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 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:57:05,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:57:05,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-09 10:57:05,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:57:09,092 INFO L124 PetriNetUnfolderBase]: 17463/25226 cut-off events. [2024-11-09 10:57:09,093 INFO L125 PetriNetUnfolderBase]: For 3089/3089 co-relation queries the response was YES. [2024-11-09 10:57:09,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53130 conditions, 25226 events. 17463/25226 cut-off events. For 3089/3089 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 154496 event pairs, 2373 based on Foata normal form. 1/25209 useless extension candidates. Maximal degree in co-relation 15519. Up to 6001 conditions per place. [2024-11-09 10:57:09,249 INFO L140 encePairwiseOnDemand]: 46/62 looper letters, 246 selfloop transitions, 18 changer transitions 19/292 dead transitions. [2024-11-09 10:57:09,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 292 transitions, 1263 flow [2024-11-09 10:57:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:57:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 10:57:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 508 transitions. [2024-11-09 10:57:09,252 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5120967741935484 [2024-11-09 10:57:09,252 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 134 flow. Second operand 16 states and 508 transitions. [2024-11-09 10:57:09,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 292 transitions, 1263 flow [2024-11-09 10:57:09,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 292 transitions, 1259 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:57:09,261 INFO L231 Difference]: Finished difference. Result has 89 places, 70 transitions, 255 flow [2024-11-09 10:57:09,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=255, PETRI_PLACES=89, PETRI_TRANSITIONS=70} [2024-11-09 10:57:09,263 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, 19 predicate places. [2024-11-09 10:57:09,264 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 70 transitions, 255 flow [2024-11-09 10:57:09,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 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:57:09,266 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:57:09,266 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:57:09,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:57:09,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:57:09,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:57:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash -799322164, now seen corresponding path program 5 times [2024-11-09 10:57:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:57:09,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975031990] [2024-11-09 10:57:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:57:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:57:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:57:09,449 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:57:09,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:57:09,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975031990] [2024-11-09 10:57:09,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975031990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:57:09,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:57:09,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:57:09,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952453071] [2024-11-09 10:57:09,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:57:09,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:57:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:57:09,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:57:09,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:57:09,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 62 [2024-11-09 10:57:09,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 70 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:09,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:57:09,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 62 [2024-11-09 10:57:09,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:57:09,686 INFO L124 PetriNetUnfolderBase]: 1634/3072 cut-off events. [2024-11-09 10:57:09,686 INFO L125 PetriNetUnfolderBase]: For 894/918 co-relation queries the response was YES. [2024-11-09 10:57:09,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7114 conditions, 3072 events. 1634/3072 cut-off events. For 894/918 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 21770 event pairs, 581 based on Foata normal form. 21/2840 useless extension candidates. Maximal degree in co-relation 7074. Up to 2444 conditions per place. [2024-11-09 10:57:09,711 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 36 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-11-09 10:57:09,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 340 flow [2024-11-09 10:57:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:57:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:57:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-11-09 10:57:09,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-11-09 10:57:09,713 INFO L175 Difference]: Start difference. First operand has 89 places, 70 transitions, 255 flow. Second operand 3 states and 138 transitions. [2024-11-09 10:57:09,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 340 flow [2024-11-09 10:57:09,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 77 transitions, 326 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-09 10:57:09,728 INFO L231 Difference]: Finished difference. Result has 84 places, 66 transitions, 229 flow [2024-11-09 10:57:09,728 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=84, PETRI_TRANSITIONS=66} [2024-11-09 10:57:09,728 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, 14 predicate places. [2024-11-09 10:57:09,729 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 66 transitions, 229 flow [2024-11-09 10:57:09,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:09,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:57:09,729 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:57:09,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:57:09,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:57:09,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:57:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash -641955878, now seen corresponding path program 6 times [2024-11-09 10:57:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:57:09,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642328729] [2024-11-09 10:57:09,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:57:09,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:57:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:57:11,440 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:57:11,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:57:11,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642328729] [2024-11-09 10:57:11,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642328729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:57:11,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:57:11,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:57:11,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862646003] [2024-11-09 10:57:11,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:57:11,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:57:11,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:57:11,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:57:11,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:57:11,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-09 10:57:11,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 66 transitions, 229 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 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:57:11,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:57:11,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-09 10:57:11,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:57:15,804 INFO L124 PetriNetUnfolderBase]: 27980/40616 cut-off events. [2024-11-09 10:57:15,804 INFO L125 PetriNetUnfolderBase]: For 23753/23753 co-relation queries the response was YES. [2024-11-09 10:57:15,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106324 conditions, 40616 events. 27980/40616 cut-off events. For 23753/23753 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 259672 event pairs, 4845 based on Foata normal form. 1/40614 useless extension candidates. Maximal degree in co-relation 61505. Up to 11479 conditions per place. [2024-11-09 10:57:16,158 INFO L140 encePairwiseOnDemand]: 46/62 looper letters, 255 selfloop transitions, 28 changer transitions 10/302 dead transitions. [2024-11-09 10:57:16,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 302 transitions, 1651 flow [2024-11-09 10:57:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:57:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-09 10:57:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 452 transitions. [2024-11-09 10:57:16,162 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4860215053763441 [2024-11-09 10:57:16,162 INFO L175 Difference]: Start difference. First operand has 84 places, 66 transitions, 229 flow. Second operand 15 states and 452 transitions. [2024-11-09 10:57:16,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 302 transitions, 1651 flow [2024-11-09 10:57:16,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 302 transitions, 1647 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:57:16,386 INFO L231 Difference]: Finished difference. Result has 107 places, 86 transitions, 464 flow [2024-11-09 10:57:16,387 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=464, PETRI_PLACES=107, PETRI_TRANSITIONS=86} [2024-11-09 10:57:16,389 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, 37 predicate places. [2024-11-09 10:57:16,390 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 86 transitions, 464 flow [2024-11-09 10:57:16,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 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:57:16,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:57:16,391 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:57:16,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:57:16,392 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:57:16,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:57:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash 555369944, now seen corresponding path program 7 times [2024-11-09 10:57:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:57:16,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663667554] [2024-11-09 10:57:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:57:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:57:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:57:18,215 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:57:18,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:57:18,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663667554] [2024-11-09 10:57:18,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663667554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:57:18,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:57:18,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:57:18,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630385519] [2024-11-09 10:57:18,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:57:18,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:57:18,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:57:18,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:57:18,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:57:18,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-09 10:57:18,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 86 transitions, 464 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 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:57:18,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:57:18,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-09 10:57:18,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:57:26,445 INFO L124 PetriNetUnfolderBase]: 54434/78826 cut-off events. [2024-11-09 10:57:26,446 INFO L125 PetriNetUnfolderBase]: For 125182/125182 co-relation queries the response was YES. [2024-11-09 10:57:27,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242380 conditions, 78826 events. 54434/78826 cut-off events. For 125182/125182 co-relation queries the response was YES. Maximal size of possible extension queue 2392. Compared 563279 event pairs, 7979 based on Foata normal form. 1/78820 useless extension candidates. Maximal degree in co-relation 242122. Up to 22972 conditions per place. [2024-11-09 10:57:27,373 INFO L140 encePairwiseOnDemand]: 46/62 looper letters, 286 selfloop transitions, 34 changer transitions 11/340 dead transitions. [2024-11-09 10:57:27,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 340 transitions, 2346 flow [2024-11-09 10:57:27,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:57:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-09 10:57:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 463 transitions. [2024-11-09 10:57:27,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4978494623655914 [2024-11-09 10:57:27,378 INFO L175 Difference]: Start difference. First operand has 107 places, 86 transitions, 464 flow. Second operand 15 states and 463 transitions. [2024-11-09 10:57:27,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 340 transitions, 2346 flow [2024-11-09 10:57:29,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 340 transitions, 2315 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-09 10:57:29,183 INFO L231 Difference]: Finished difference. Result has 129 places, 108 transitions, 789 flow [2024-11-09 10:57:29,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=789, PETRI_PLACES=129, PETRI_TRANSITIONS=108} [2024-11-09 10:57:29,184 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, 59 predicate places. [2024-11-09 10:57:29,184 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 108 transitions, 789 flow [2024-11-09 10:57:29,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 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:57:29,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:57:29,185 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:57:29,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:57:29,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:57:29,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:57:29,186 INFO L85 PathProgramCache]: Analyzing trace with hash 401941916, now seen corresponding path program 8 times [2024-11-09 10:57:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:57:29,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108911303] [2024-11-09 10:57:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:57:29,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:57:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:57:30,926 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:57:30,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:57:30,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108911303] [2024-11-09 10:57:30,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108911303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:57:30,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:57:30,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:57:30,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381326088] [2024-11-09 10:57:30,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:57:30,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:57:30,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:57:30,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:57:30,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:57:31,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-09 10:57:31,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 108 transitions, 789 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 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:57:31,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:57:31,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-09 10:57:31,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:57:44,772 INFO L124 PetriNetUnfolderBase]: 91340/133957 cut-off events. [2024-11-09 10:57:44,773 INFO L125 PetriNetUnfolderBase]: For 407402/407402 co-relation queries the response was YES. [2024-11-09 10:57:45,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461698 conditions, 133957 events. 91340/133957 cut-off events. For 407402/407402 co-relation queries the response was YES. Maximal size of possible extension queue 4334. Compared 1041286 event pairs, 14992 based on Foata normal form. 1/133950 useless extension candidates. Maximal degree in co-relation 461037. Up to 32616 conditions per place. [2024-11-09 10:57:46,145 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 337 selfloop transitions, 51 changer transitions 10/407 dead transitions. [2024-11-09 10:57:46,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 407 transitions, 3510 flow [2024-11-09 10:57:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:57:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-09 10:57:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 468 transitions. [2024-11-09 10:57:46,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5032258064516129 [2024-11-09 10:57:46,148 INFO L175 Difference]: Start difference. First operand has 129 places, 108 transitions, 789 flow. Second operand 15 states and 468 transitions. [2024-11-09 10:57:46,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 407 transitions, 3510 flow [2024-11-09 10:57:53,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 407 transitions, 3365 flow, removed 66 selfloop flow, removed 3 redundant places. [2024-11-09 10:57:53,787 INFO L231 Difference]: Finished difference. Result has 151 places, 140 transitions, 1309 flow [2024-11-09 10:57:53,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1309, PETRI_PLACES=151, PETRI_TRANSITIONS=140} [2024-11-09 10:57:53,788 INFO L277 CegarLoopForPetriNet]: 70 programPoint places, 81 predicate places. [2024-11-09 10:57:53,788 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 140 transitions, 1309 flow [2024-11-09 10:57:53,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 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:57:53,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:57:53,789 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:57:53,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:57:53,789 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:57:53,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:57:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1660644852, now seen corresponding path program 9 times [2024-11-09 10:57:53,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:57:53,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118160501] [2024-11-09 10:57:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:57:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:57:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:57:54,972 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:57:54,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:57:54,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118160501] [2024-11-09 10:57:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118160501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:57:54,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:57:54,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:57:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300415896] [2024-11-09 10:57:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:57:54,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:57:54,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:57:54,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:57:54,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:57:55,076 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2024-11-09 10:57:55,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 140 transitions, 1309 flow. Second operand has 14 states, 14 states have (on average 17.285714285714285) internal successors, (242), 14 states have internal predecessors, (242), 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:57:55,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:57:55,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2024-11-09 10:57:55,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand