./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:08:36,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:08:36,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:08:36,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:08:36,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:08:36,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:08:36,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:08:36,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:08:36,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:08:36,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:08:36,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:08:36,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:08:36,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:08:36,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:08:36,899 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:08:36,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:08:36,899 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:08:36,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:08:36,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:08:36,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:08:36,901 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:08:36,904 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:08:36,904 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:08:36,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:08:36,904 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:08:36,905 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:08:36,905 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:08:36,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:08:36,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:08:36,906 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:08:36,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:08:36,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:08:36,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:08:36,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:08:36,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:08:36,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:08:36,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:08:36,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:08:36,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:08:36,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:08:36,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:08:36,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:08:36,913 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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2024-10-13 12:08:37,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:08:37,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:08:37,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:08:37,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:08:37,243 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:08:37,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-10-13 12:08:38,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:08:38,946 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:08:38,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-10-13 12:08:38,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07839937d/1585705702594db0a96cc7f117dbe688/FLAG30d6e24c7 [2024-10-13 12:08:38,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07839937d/1585705702594db0a96cc7f117dbe688 [2024-10-13 12:08:38,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:08:38,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:08:38,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:08:38,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:08:38,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:08:38,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:08:38" (1/1) ... [2024-10-13 12:08:38,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d5fdb76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:38, skipping insertion in model container [2024-10-13 12:08:38,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:08:38" (1/1) ... [2024-10-13 12:08:39,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:08:39,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:08:39,393 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:08:39,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:08:39,500 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:08:39,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39 WrapperNode [2024-10-13 12:08:39,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:08:39,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:08:39,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:08:39,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:08:39,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,552 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-10-13 12:08:39,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:08:39,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:08:39,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:08:39,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:08:39,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,584 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-10-13 12:08:39,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:08:39,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:08:39,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:08:39,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:08:39,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (1/1) ... [2024-10-13 12:08:39,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:08:39,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:39,655 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-10-13 12:08:39,658 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-10-13 12:08:39,708 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-13 12:08:39,709 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-13 12:08:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-13 12:08:39,709 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-13 12:08:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:08:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:08:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:08:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:08:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:08:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:08:39,711 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:08:39,903 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:08:39,906 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:08:40,057 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:08:40,058 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:08:40,147 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:08:40,147 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:08:40,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:40 BoogieIcfgContainer [2024-10-13 12:08:40,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:08:40,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:08:40,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:08:40,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:08:40,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:08:38" (1/3) ... [2024-10-13 12:08:40,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed2b849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:08:40, skipping insertion in model container [2024-10-13 12:08:40,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:39" (2/3) ... [2024-10-13 12:08:40,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed2b849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:08:40, skipping insertion in model container [2024-10-13 12:08:40,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:40" (3/3) ... [2024-10-13 12:08:40,159 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-10-13 12:08:40,176 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:08:40,176 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:08:40,176 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:08:40,221 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:08:40,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2024-10-13 12:08:40,289 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-10-13 12:08:40,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:08:40,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-10-13 12:08:40,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2024-10-13 12:08:40,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2024-10-13 12:08:40,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:08:40,319 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;@a15f230, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:08:40,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 12:08:40,328 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:08:40,328 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-10-13 12:08:40,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:08:40,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:40,332 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:40,333 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-10-13 12:08:40,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:40,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1038261642, now seen corresponding path program 1 times [2024-10-13 12:08:40,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:40,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266610959] [2024-10-13 12:08:40,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:40,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:40,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:40,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266610959] [2024-10-13 12:08:40,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266610959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:40,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:40,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:08:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304935648] [2024-10-13 12:08:40,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:40,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:08:40,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:40,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:08:40,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:08:40,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2024-10-13 12:08:40,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-13 12:08:40,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:40,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2024-10-13 12:08:40,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:40,700 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2024-10-13 12:08:40,700 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:08:40,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 157 events. 70/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 554 event pairs, 44 based on Foata normal form. 15/161 useless extension candidates. Maximal degree in co-relation 272. Up to 113 conditions per place. [2024-10-13 12:08:40,706 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2024-10-13 12:08:40,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2024-10-13 12:08:40,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:08:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:08:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-10-13 12:08:40,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-10-13 12:08:40,722 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2024-10-13 12:08:40,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2024-10-13 12:08:40,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:08:40,727 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2024-10-13 12:08:40,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2024-10-13 12:08:40,734 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2024-10-13 12:08:40,735 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2024-10-13 12:08:40,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-13 12:08:40,735 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:40,735 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:40,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:08:40,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:08:40,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1038262774, now seen corresponding path program 1 times [2024-10-13 12:08:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:40,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244453837] [2024-10-13 12:08:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:40,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:41,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:41,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244453837] [2024-10-13 12:08:41,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244453837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:41,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:41,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:08:41,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315437749] [2024-10-13 12:08:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:41,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:08:41,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:41,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:08:41,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:08:41,095 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:41,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-13 12:08:41,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:41,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:41,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:41,308 INFO L124 PetriNetUnfolderBase]: 273/487 cut-off events. [2024-10-13 12:08:41,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:08:41,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 487 events. 273/487 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1990 event pairs, 45 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 921. Up to 181 conditions per place. [2024-10-13 12:08:41,317 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 4 changer transitions 21/54 dead transitions. [2024-10-13 12:08:41,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 54 transitions, 212 flow [2024-10-13 12:08:41,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:08:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:08:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-10-13 12:08:41,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2024-10-13 12:08:41,322 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 6 states and 99 transitions. [2024-10-13 12:08:41,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 54 transitions, 212 flow [2024-10-13 12:08:41,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:08:41,325 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 74 flow [2024-10-13 12:08:41,325 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, 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=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2024-10-13 12:08:41,326 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2024-10-13 12:08:41,326 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 74 flow [2024-10-13 12:08:41,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-13 12:08:41,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:41,327 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:41,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:08:41,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:08:41,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:41,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1117686194, now seen corresponding path program 1 times [2024-10-13 12:08:41,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:41,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789263598] [2024-10-13 12:08:41,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:41,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:41,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:41,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789263598] [2024-10-13 12:08:41,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789263598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:41,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:41,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:08:41,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576316214] [2024-10-13 12:08:41,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:41,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:08:41,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:41,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:08:41,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:08:41,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:41,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-13 12:08:41,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:41,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:41,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:41,749 INFO L124 PetriNetUnfolderBase]: 382/704 cut-off events. [2024-10-13 12:08:41,749 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2024-10-13 12:08:41,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 704 events. 382/704 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3073 event pairs, 65 based on Foata normal form. 27/727 useless extension candidates. Maximal degree in co-relation 1591. Up to 246 conditions per place. [2024-10-13 12:08:41,761 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 9 changer transitions 20/79 dead transitions. [2024-10-13 12:08:41,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 382 flow [2024-10-13 12:08:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:08:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:08:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-10-13 12:08:41,763 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-10-13 12:08:41,764 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 74 flow. Second operand 9 states and 144 transitions. [2024-10-13 12:08:41,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 382 flow [2024-10-13 12:08:41,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 366 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-10-13 12:08:41,772 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 159 flow [2024-10-13 12:08:41,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=159, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2024-10-13 12:08:41,773 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2024-10-13 12:08:41,773 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 159 flow [2024-10-13 12:08:41,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-13 12:08:41,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:41,773 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:41,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:08:41,774 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-10-13 12:08:41,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:41,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1000674482, now seen corresponding path program 2 times [2024-10-13 12:08:41,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:41,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034452364] [2024-10-13 12:08:41,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:41,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:41,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034452364] [2024-10-13 12:08:41,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034452364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:41,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:41,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:08:41,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518348738] [2024-10-13 12:08:41,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:41,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:08:41,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:41,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:08:41,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:08:41,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:41,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-13 12:08:41,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:41,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:41,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:42,170 INFO L124 PetriNetUnfolderBase]: 328/611 cut-off events. [2024-10-13 12:08:42,171 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2024-10-13 12:08:42,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 611 events. 328/611 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2595 event pairs, 65 based on Foata normal form. 45/652 useless extension candidates. Maximal degree in co-relation 1723. Up to 234 conditions per place. [2024-10-13 12:08:42,176 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 9 changer transitions 28/79 dead transitions. [2024-10-13 12:08:42,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 499 flow [2024-10-13 12:08:42,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:08:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:08:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-10-13 12:08:42,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5474137931034483 [2024-10-13 12:08:42,180 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 159 flow. Second operand 8 states and 127 transitions. [2024-10-13 12:08:42,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 499 flow [2024-10-13 12:08:42,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 491 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-13 12:08:42,187 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 213 flow [2024-10-13 12:08:42,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2024-10-13 12:08:42,188 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-10-13 12:08:42,189 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 213 flow [2024-10-13 12:08:42,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-13 12:08:42,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:42,191 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:42,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:08:42,192 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-10-13 12:08:42,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1356857717, now seen corresponding path program 1 times [2024-10-13 12:08:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:42,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789936558] [2024-10-13 12:08:42,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:42,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789936558] [2024-10-13 12:08:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789936558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:42,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:42,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:08:42,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804251807] [2024-10-13 12:08:42,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:42,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:08:42,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:42,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:08:42,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:08:42,342 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:42,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 213 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:08:42,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:42,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:42,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:42,631 INFO L124 PetriNetUnfolderBase]: 337/620 cut-off events. [2024-10-13 12:08:42,631 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2024-10-13 12:08:42,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 620 events. 337/620 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2632 event pairs, 74 based on Foata normal form. 18/634 useless extension candidates. Maximal degree in co-relation 1923. Up to 237 conditions per place. [2024-10-13 12:08:42,637 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 16 changer transitions 24/90 dead transitions. [2024-10-13 12:08:42,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 610 flow [2024-10-13 12:08:42,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:08:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:08:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-10-13 12:08:42,639 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2024-10-13 12:08:42,639 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 213 flow. Second operand 11 states and 168 transitions. [2024-10-13 12:08:42,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 610 flow [2024-10-13 12:08:42,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 543 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-10-13 12:08:42,653 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 282 flow [2024-10-13 12:08:42,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=282, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-10-13 12:08:42,654 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-10-13 12:08:42,654 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 282 flow [2024-10-13 12:08:42,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:08:42,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:42,655 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:42,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:08:42,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:08:42,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:42,656 INFO L85 PathProgramCache]: Analyzing trace with hash 392343623, now seen corresponding path program 2 times [2024-10-13 12:08:42,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:42,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070210642] [2024-10-13 12:08:42,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:42,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:42,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070210642] [2024-10-13 12:08:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070210642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:42,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:08:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739980921] [2024-10-13 12:08:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:42,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:08:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:42,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:08:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:08:42,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:42,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:08:42,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:42,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:42,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:43,041 INFO L124 PetriNetUnfolderBase]: 445/807 cut-off events. [2024-10-13 12:08:43,041 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2024-10-13 12:08:43,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2634 conditions, 807 events. 445/807 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3481 event pairs, 59 based on Foata normal form. 27/828 useless extension candidates. Maximal degree in co-relation 2610. Up to 151 conditions per place. [2024-10-13 12:08:43,048 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 44 selfloop transitions, 23 changer transitions 30/101 dead transitions. [2024-10-13 12:08:43,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 101 transitions, 742 flow [2024-10-13 12:08:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:08:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:08:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2024-10-13 12:08:43,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5360501567398119 [2024-10-13 12:08:43,050 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 282 flow. Second operand 11 states and 171 transitions. [2024-10-13 12:08:43,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 101 transitions, 742 flow [2024-10-13 12:08:43,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 688 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-10-13 12:08:43,060 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 393 flow [2024-10-13 12:08:43,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=393, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2024-10-13 12:08:43,063 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-10-13 12:08:43,064 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 393 flow [2024-10-13 12:08:43,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:08:43,064 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:43,064 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:43,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:08:43,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:08:43,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1383133169, now seen corresponding path program 1 times [2024-10-13 12:08:43,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:43,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68670430] [2024-10-13 12:08:43,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:43,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:43,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68670430] [2024-10-13 12:08:43,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68670430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:08:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599716782] [2024-10-13 12:08:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:43,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:43,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:43,229 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-10-13 12:08:43,231 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-10-13 12:08:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:43,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:08:43,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:43,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:08:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:43,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599716782] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:08:43,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:08:43,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-13 12:08:43,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775708045] [2024-10-13 12:08:43,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:08:43,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:08:43,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:43,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:08:43,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:08:43,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:43,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 393 flow. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 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-10-13 12:08:43,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:43,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:43,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:44,065 INFO L124 PetriNetUnfolderBase]: 571/1058 cut-off events. [2024-10-13 12:08:44,067 INFO L125 PetriNetUnfolderBase]: For 6872/6872 co-relation queries the response was YES. [2024-10-13 12:08:44,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4148 conditions, 1058 events. 571/1058 cut-off events. For 6872/6872 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4466 event pairs, 137 based on Foata normal form. 63/1117 useless extension candidates. Maximal degree in co-relation 4119. Up to 486 conditions per place. [2024-10-13 12:08:44,074 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 64 selfloop transitions, 17 changer transitions 67/152 dead transitions. [2024-10-13 12:08:44,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 152 transitions, 1349 flow [2024-10-13 12:08:44,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 12:08:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-13 12:08:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2024-10-13 12:08:44,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5226860254083484 [2024-10-13 12:08:44,077 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 393 flow. Second operand 19 states and 288 transitions. [2024-10-13 12:08:44,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 152 transitions, 1349 flow [2024-10-13 12:08:44,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 152 transitions, 1270 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-10-13 12:08:44,091 INFO L231 Difference]: Finished difference. Result has 90 places, 52 transitions, 524 flow [2024-10-13 12:08:44,091 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=524, PETRI_PLACES=90, PETRI_TRANSITIONS=52} [2024-10-13 12:08:44,092 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2024-10-13 12:08:44,092 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 52 transitions, 524 flow [2024-10-13 12:08:44,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 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-10-13 12:08:44,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:44,093 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:44,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:08:44,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:44,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:08:44,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:44,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1985942713, now seen corresponding path program 2 times [2024-10-13 12:08:44,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:44,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641116966] [2024-10-13 12:08:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:44,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:44,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641116966] [2024-10-13 12:08:44,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641116966] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:08:44,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780906325] [2024-10-13 12:08:44,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:08:44,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:44,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:44,416 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-10-13 12:08:44,418 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-10-13 12:08:44,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:08:44,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:08:44,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:08:44,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:44,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:08:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:44,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780906325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:08:44,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:08:44,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-13 12:08:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633894196] [2024-10-13 12:08:44,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:08:44,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:08:44,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:44,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:08:44,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:08:44,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:44,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 52 transitions, 524 flow. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 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-10-13 12:08:44,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:44,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:44,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:45,376 INFO L124 PetriNetUnfolderBase]: 877/1628 cut-off events. [2024-10-13 12:08:45,378 INFO L125 PetriNetUnfolderBase]: For 29480/29480 co-relation queries the response was YES. [2024-10-13 12:08:45,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8520 conditions, 1628 events. 877/1628 cut-off events. For 29480/29480 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7913 event pairs, 70 based on Foata normal form. 72/1696 useless extension candidates. Maximal degree in co-relation 8480. Up to 249 conditions per place. [2024-10-13 12:08:45,400 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 88 selfloop transitions, 46 changer transitions 80/218 dead transitions. [2024-10-13 12:08:45,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 218 transitions, 2565 flow [2024-10-13 12:08:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 12:08:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-10-13 12:08:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 415 transitions. [2024-10-13 12:08:45,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5300127713920817 [2024-10-13 12:08:45,403 INFO L175 Difference]: Start difference. First operand has 90 places, 52 transitions, 524 flow. Second operand 27 states and 415 transitions. [2024-10-13 12:08:45,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 218 transitions, 2565 flow [2024-10-13 12:08:45,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 218 transitions, 2089 flow, removed 227 selfloop flow, removed 12 redundant places. [2024-10-13 12:08:45,431 INFO L231 Difference]: Finished difference. Result has 116 places, 70 transitions, 908 flow [2024-10-13 12:08:45,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=908, PETRI_PLACES=116, PETRI_TRANSITIONS=70} [2024-10-13 12:08:45,434 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2024-10-13 12:08:45,435 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 70 transitions, 908 flow [2024-10-13 12:08:45,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 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-10-13 12:08:45,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:45,435 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:45,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 12:08:45,637 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,SelfDestructingSolverStorable7 [2024-10-13 12:08:45,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:08:45,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:45,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1216840336, now seen corresponding path program 1 times [2024-10-13 12:08:45,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:45,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990751205] [2024-10-13 12:08:45,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:45,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:45,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990751205] [2024-10-13 12:08:45,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990751205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:08:45,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025055594] [2024-10-13 12:08:45,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:45,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:45,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:45,819 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-10-13 12:08:45,821 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-10-13 12:08:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:45,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:08:45,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:45,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:08:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:46,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025055594] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:08:46,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:08:46,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-13 12:08:46,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505251756] [2024-10-13 12:08:46,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:08:46,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 12:08:46,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:46,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 12:08:46,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-10-13 12:08:46,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:46,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 70 transitions, 908 flow. Second operand has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:08:46,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:46,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:46,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:47,035 INFO L124 PetriNetUnfolderBase]: 1093/2114 cut-off events. [2024-10-13 12:08:47,035 INFO L125 PetriNetUnfolderBase]: For 73277/73277 co-relation queries the response was YES. [2024-10-13 12:08:47,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13414 conditions, 2114 events. 1093/2114 cut-off events. For 73277/73277 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11488 event pairs, 94 based on Foata normal form. 72/2182 useless extension candidates. Maximal degree in co-relation 13362. Up to 409 conditions per place. [2024-10-13 12:08:47,062 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 86 selfloop transitions, 64 changer transitions 88/242 dead transitions. [2024-10-13 12:08:47,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 242 transitions, 3738 flow [2024-10-13 12:08:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-13 12:08:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-10-13 12:08:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 425 transitions. [2024-10-13 12:08:47,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5233990147783252 [2024-10-13 12:08:47,065 INFO L175 Difference]: Start difference. First operand has 116 places, 70 transitions, 908 flow. Second operand 28 states and 425 transitions. [2024-10-13 12:08:47,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 242 transitions, 3738 flow [2024-10-13 12:08:47,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 242 transitions, 3143 flow, removed 281 selfloop flow, removed 15 redundant places. [2024-10-13 12:08:47,141 INFO L231 Difference]: Finished difference. Result has 138 places, 92 transitions, 1417 flow [2024-10-13 12:08:47,142 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1417, PETRI_PLACES=138, PETRI_TRANSITIONS=92} [2024-10-13 12:08:47,143 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2024-10-13 12:08:47,143 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 92 transitions, 1417 flow [2024-10-13 12:08:47,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:08:47,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:47,143 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:47,161 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-10-13 12:08:47,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:47,344 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:08:47,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash -974308042, now seen corresponding path program 2 times [2024-10-13 12:08:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:47,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410879] [2024-10-13 12:08:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:47,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410879] [2024-10-13 12:08:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:08:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328800608] [2024-10-13 12:08:47,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:08:47,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:47,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:47,492 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-10-13 12:08:47,494 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-10-13 12:08:47,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:08:47,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:08:47,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:08:47,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:47,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:08:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:47,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328800608] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:08:47,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:08:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-10-13 12:08:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875796404] [2024-10-13 12:08:47,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:08:47,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 12:08:47,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:47,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 12:08:47,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-10-13 12:08:47,757 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:47,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 92 transitions, 1417 flow. Second operand has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 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-10-13 12:08:47,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:47,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:47,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:49,015 INFO L124 PetriNetUnfolderBase]: 1399/2654 cut-off events. [2024-10-13 12:08:49,016 INFO L125 PetriNetUnfolderBase]: For 156808/156808 co-relation queries the response was YES. [2024-10-13 12:08:49,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19910 conditions, 2654 events. 1399/2654 cut-off events. For 156808/156808 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 14350 event pairs, 50 based on Foata normal form. 99/2749 useless extension candidates. Maximal degree in co-relation 19848. Up to 528 conditions per place. [2024-10-13 12:08:49,058 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 112 selfloop transitions, 95 changer transitions 113/324 dead transitions. [2024-10-13 12:08:49,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 324 transitions, 6002 flow [2024-10-13 12:08:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-13 12:08:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-10-13 12:08:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 551 transitions. [2024-10-13 12:08:49,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-10-13 12:08:49,062 INFO L175 Difference]: Start difference. First operand has 138 places, 92 transitions, 1417 flow. Second operand 36 states and 551 transitions. [2024-10-13 12:08:49,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 324 transitions, 6002 flow [2024-10-13 12:08:49,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 324 transitions, 5013 flow, removed 469 selfloop flow, removed 16 redundant places. [2024-10-13 12:08:49,298 INFO L231 Difference]: Finished difference. Result has 172 places, 120 transitions, 2180 flow [2024-10-13 12:08:49,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2180, PETRI_PLACES=172, PETRI_TRANSITIONS=120} [2024-10-13 12:08:49,298 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-10-13 12:08:49,299 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 120 transitions, 2180 flow [2024-10-13 12:08:49,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 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-10-13 12:08:49,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:49,299 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:49,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 12:08:49,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:49,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:08:49,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1191975869, now seen corresponding path program 3 times [2024-10-13 12:08:49,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:49,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995672683] [2024-10-13 12:08:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:49,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:49,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:08:49,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995672683] [2024-10-13 12:08:49,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995672683] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:08:49,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867491889] [2024-10-13 12:08:49,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:08:49,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:08:49,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:49,744 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-10-13 12:08:49,745 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-10-13 12:08:49,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 12:08:49,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:08:49,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 12:08:49,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:49,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:08:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:49,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867491889] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:08:49,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:08:49,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2024-10-13 12:08:49,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341802424] [2024-10-13 12:08:49,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:08:49,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 12:08:49,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:08:49,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 12:08:49,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-10-13 12:08:50,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:50,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 120 transitions, 2180 flow. Second operand has 16 states, 16 states have (on average 9.8125) internal successors, (157), 16 states have internal predecessors, (157), 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-10-13 12:08:50,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:50,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:50,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:51,108 INFO L124 PetriNetUnfolderBase]: 1444/2765 cut-off events. [2024-10-13 12:08:51,108 INFO L125 PetriNetUnfolderBase]: For 202456/202456 co-relation queries the response was YES. [2024-10-13 12:08:51,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21212 conditions, 2765 events. 1444/2765 cut-off events. For 202456/202456 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 14718 event pairs, 74 based on Foata normal form. 18/2779 useless extension candidates. Maximal degree in co-relation 21135. Up to 486 conditions per place. [2024-10-13 12:08:51,159 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 104 selfloop transitions, 98 changer transitions 51/257 dead transitions. [2024-10-13 12:08:51,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 257 transitions, 4926 flow [2024-10-13 12:08:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 12:08:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-13 12:08:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 365 transitions. [2024-10-13 12:08:51,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5244252873563219 [2024-10-13 12:08:51,161 INFO L175 Difference]: Start difference. First operand has 172 places, 120 transitions, 2180 flow. Second operand 24 states and 365 transitions. [2024-10-13 12:08:51,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 257 transitions, 4926 flow [2024-10-13 12:08:51,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 257 transitions, 3755 flow, removed 551 selfloop flow, removed 24 redundant places. [2024-10-13 12:08:51,494 INFO L231 Difference]: Finished difference. Result has 172 places, 133 transitions, 2094 flow [2024-10-13 12:08:51,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2094, PETRI_PLACES=172, PETRI_TRANSITIONS=133} [2024-10-13 12:08:51,495 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-10-13 12:08:51,495 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 133 transitions, 2094 flow [2024-10-13 12:08:51,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.8125) internal successors, (157), 16 states have internal predecessors, (157), 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-10-13 12:08:51,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:51,496 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:51,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 12:08:51,696 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,SelfDestructingSolverStorable10 [2024-10-13 12:08:51,697 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:08:51,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1362475303, now seen corresponding path program 4 times [2024-10-13 12:08:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:08:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348173005] [2024-10-13 12:08:51,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:08:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:08:51,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:08:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:08:51,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:08:51,748 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:08:51,749 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-10-13 12:08:51,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-10-13 12:08:51,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-13 12:08:51,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-10-13 12:08:51,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 12:08:51,754 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1] [2024-10-13 12:08:51,817 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:08:51,817 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:08:51,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:08:51 BasicIcfg [2024-10-13 12:08:51,824 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:08:51,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:08:51,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:08:51,825 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:08:51,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:40" (3/4) ... [2024-10-13 12:08:51,828 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:08:51,829 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:08:51,830 INFO L158 Benchmark]: Toolchain (without parser) took 12846.18ms. Allocated memory was 142.6MB in the beginning and 312.5MB in the end (delta: 169.9MB). Free memory was 102.8MB in the beginning and 145.0MB in the end (delta: -42.2MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. [2024-10-13 12:08:51,830 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:08:51,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.94ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 81.2MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 12:08:51,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.27ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 79.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:08:51,831 INFO L158 Benchmark]: Boogie Preprocessor took 54.95ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 77.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:08:51,834 INFO L158 Benchmark]: RCFGBuilder took 538.38ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 99.9MB in the end (delta: -22.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 12:08:51,835 INFO L158 Benchmark]: TraceAbstraction took 11672.81ms. Allocated memory was 142.6MB in the beginning and 312.5MB in the end (delta: 169.9MB). Free memory was 99.2MB in the beginning and 145.0MB in the end (delta: -45.8MB). Peak memory consumption was 125.4MB. Max. memory is 16.1GB. [2024-10-13 12:08:51,836 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 312.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:08:51,837 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.94ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 81.2MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.27ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 79.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.95ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 77.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 538.38ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 99.9MB in the end (delta: -22.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11672.81ms. Allocated memory was 142.6MB in the beginning and 312.5MB in the end (delta: 169.9MB). Free memory was 99.2MB in the beginning and 145.0MB in the end (delta: -45.8MB). Peak memory consumption was 125.4MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 312.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 693]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 693. Possible FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, argc=49, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, argc=49, i=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, i=13, id1=-1, id2=0, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ [L722] CALL 0 reach_error() [L693] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L693] 0 __assert_fail ("0", "triangular-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] - UnprovableResult [Line: 711]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.5s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1658 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1631 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2966 IncrementalHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 10 mSDtfsCounter, 2966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 209 SyntacticMatches, 8 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2180occurred in iteration=10, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 423 ConstructedInterpolants, 0 QuantifiedInterpolants, 1586 SizeOfPredicates, 29 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 0/174 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 12:08:51,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:08:54,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:08:54,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:08:54,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:08:54,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:08:54,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:08:54,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:08:54,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:08:54,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:08:54,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:08:54,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:08:54,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:08:54,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:08:54,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:08:54,304 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:08:54,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:08:54,305 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:08:54,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:08:54,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:08:54,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:08:54,310 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:08:54,310 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:08:54,311 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:08:54,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:08:54,311 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:08:54,311 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:08:54,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:08:54,312 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:08:54,312 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:08:54,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:08:54,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:08:54,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:08:54,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:08:54,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:08:54,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:08:54,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:08:54,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:08:54,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:08:54,316 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:08:54,316 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:08:54,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:08:54,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:08:54,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:08:54,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:08:54,318 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:08:54,318 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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2024-10-13 12:08:54,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:08:54,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:08:54,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:08:54,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:08:54,687 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:08:54,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-10-13 12:08:56,367 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:08:56,685 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:08:56,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-10-13 12:08:56,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfc168e6/5d9deee522bd42b7a81ea9d3d4ef4104/FLAG20c50bcad [2024-10-13 12:08:56,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfc168e6/5d9deee522bd42b7a81ea9d3d4ef4104 [2024-10-13 12:08:56,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:08:56,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:08:56,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:08:56,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:08:56,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:08:56,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:08:56" (1/1) ... [2024-10-13 12:08:56,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc6a9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:56, skipping insertion in model container [2024-10-13 12:08:56,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:08:56" (1/1) ... [2024-10-13 12:08:56,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:08:57,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:08:57,153 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:08:57,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:08:57,259 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:08:57,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57 WrapperNode [2024-10-13 12:08:57,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:08:57,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:08:57,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:08:57,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:08:57,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,309 INFO L138 Inliner]: procedures = 169, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2024-10-13 12:08:57,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:08:57,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:08:57,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:08:57,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:08:57,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,343 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-10-13 12:08:57,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:08:57,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:08:57,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:08:57,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:08:57,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (1/1) ... [2024-10-13 12:08:57,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:08:57,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:08:57,400 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-10-13 12:08:57,403 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-10-13 12:08:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-13 12:08:57,445 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-13 12:08:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-13 12:08:57,445 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-13 12:08:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:08:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:08:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:08:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:08:57,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:08:57,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:08:57,448 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:08:57,587 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:08:57,590 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:08:57,750 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:08:57,751 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:08:57,918 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:08:57,918 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:08:57,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:57 BoogieIcfgContainer [2024-10-13 12:08:57,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:08:57,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:08:57,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:08:57,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:08:57,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:08:56" (1/3) ... [2024-10-13 12:08:57,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553d4e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:08:57, skipping insertion in model container [2024-10-13 12:08:57,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:08:57" (2/3) ... [2024-10-13 12:08:57,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553d4e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:08:57, skipping insertion in model container [2024-10-13 12:08:57,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:57" (3/3) ... [2024-10-13 12:08:57,929 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-10-13 12:08:57,946 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:08:57,946 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:08:57,946 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:08:57,992 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:08:58,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2024-10-13 12:08:58,059 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-10-13 12:08:58,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:08:58,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-10-13 12:08:58,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2024-10-13 12:08:58,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2024-10-13 12:08:58,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:08:58,088 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;@559b81c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:08:58,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 12:08:58,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:08:58,106 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-10-13 12:08:58,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:08:58,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:58,107 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:58,107 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-10-13 12:08:58,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:58,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1944846646, now seen corresponding path program 1 times [2024-10-13 12:08:58,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:08:58,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024807177] [2024-10-13 12:08:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:58,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:08:58,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:08:58,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:08:58,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 12:08:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:58,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:08:58,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:58,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:08:58,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:08:58,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024807177] [2024-10-13 12:08:58,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024807177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:58,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:58,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:08:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228795031] [2024-10-13 12:08:58,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:58,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:08:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:08:58,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:08:58,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:08:58,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2024-10-13 12:08:58,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-13 12:08:58,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:58,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2024-10-13 12:08:58,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:58,399 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2024-10-13 12:08:58,399 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:08:58,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 157 events. 70/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 552 event pairs, 44 based on Foata normal form. 15/161 useless extension candidates. Maximal degree in co-relation 272. Up to 113 conditions per place. [2024-10-13 12:08:58,403 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2024-10-13 12:08:58,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2024-10-13 12:08:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:08:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:08:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-10-13 12:08:58,412 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-10-13 12:08:58,413 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2024-10-13 12:08:58,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2024-10-13 12:08:58,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:08:58,418 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2024-10-13 12:08:58,420 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2024-10-13 12:08:58,424 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2024-10-13 12:08:58,426 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2024-10-13 12:08:58,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-13 12:08:58,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:58,427 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:58,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:08:58,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:08:58,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:08:58,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1944845514, now seen corresponding path program 1 times [2024-10-13 12:08:58,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:08:58,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148311665] [2024-10-13 12:08:58,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:58,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:08:58,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:08:58,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:08:58,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:08:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:58,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:08:58,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:58,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:08:58,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:08:58,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148311665] [2024-10-13 12:08:58,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148311665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:58,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:58,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:08:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697314370] [2024-10-13 12:08:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:58,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:08:58,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:08:58,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:08:58,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:08:58,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:58,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-13 12:08:58,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:58,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:58,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:59,145 INFO L124 PetriNetUnfolderBase]: 328/593 cut-off events. [2024-10-13 12:08:59,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:08:59,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 593 events. 328/593 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2597 event pairs, 45 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 1120. Up to 243 conditions per place. [2024-10-13 12:08:59,151 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 29 selfloop transitions, 7 changer transitions 29/69 dead transitions. [2024-10-13 12:08:59,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 69 transitions, 274 flow [2024-10-13 12:08:59,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:08:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:08:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-10-13 12:08:59,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2024-10-13 12:08:59,155 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 8 states and 131 transitions. [2024-10-13 12:08:59,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 69 transitions, 274 flow [2024-10-13 12:08:59,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 69 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:08:59,160 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 100 flow [2024-10-13 12:08:59,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, 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=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2024-10-13 12:08:59,161 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-10-13 12:08:59,161 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 100 flow [2024-10-13 12:08:59,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-10-13 12:08:59,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:59,162 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:59,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 12:08:59,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:08:59,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:08:59,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash 407958523, now seen corresponding path program 1 times [2024-10-13 12:08:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:08:59,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598780718] [2024-10-13 12:08:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:59,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:08:59,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:08:59,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:08:59,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 12:08:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:08:59,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:08:59,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:08:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:08:59,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:08:59,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:08:59,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598780718] [2024-10-13 12:08:59,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598780718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:08:59,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:08:59,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:08:59,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365585255] [2024-10-13 12:08:59,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:08:59,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:08:59,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:08:59,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:08:59,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:08:59,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:08:59,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-13 12:08:59,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:08:59,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:08:59,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:08:59,743 INFO L124 PetriNetUnfolderBase]: 247/454 cut-off events. [2024-10-13 12:08:59,743 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2024-10-13 12:08:59,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 454 events. 247/454 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1806 event pairs, 50 based on Foata normal form. 18/468 useless extension candidates. Maximal degree in co-relation 1170. Up to 190 conditions per place. [2024-10-13 12:08:59,753 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 9 changer transitions 16/59 dead transitions. [2024-10-13 12:08:59,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 316 flow [2024-10-13 12:08:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:08:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:08:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-10-13 12:08:59,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.541871921182266 [2024-10-13 12:08:59,757 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 100 flow. Second operand 7 states and 110 transitions. [2024-10-13 12:08:59,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 316 flow [2024-10-13 12:08:59,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-13 12:08:59,764 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 143 flow [2024-10-13 12:08:59,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2024-10-13 12:08:59,765 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-10-13 12:08:59,765 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 143 flow [2024-10-13 12:08:59,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-13 12:08:59,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:08:59,766 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:08:59,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 12:08:59,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:08:59,967 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-10-13 12:08:59,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:08:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1492998092, now seen corresponding path program 1 times [2024-10-13 12:08:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:08:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370774890] [2024-10-13 12:08:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:08:59,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:08:59,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:08:59,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:08:59,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 12:09:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:00,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:09:00,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:00,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:00,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:00,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370774890] [2024-10-13 12:09:00,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370774890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:00,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:00,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:09:00,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103095617] [2024-10-13 12:09:00,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:00,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:00,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:00,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:00,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:00,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:09:00,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-13 12:09:00,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:00,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:09:00,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:00,402 INFO L124 PetriNetUnfolderBase]: 391/725 cut-off events. [2024-10-13 12:09:00,402 INFO L125 PetriNetUnfolderBase]: For 1146/1146 co-relation queries the response was YES. [2024-10-13 12:09:00,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 725 events. 391/725 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3195 event pairs, 95 based on Foata normal form. 27/748 useless extension candidates. Maximal degree in co-relation 2098. Up to 264 conditions per place. [2024-10-13 12:09:00,408 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 11 changer transitions 20/82 dead transitions. [2024-10-13 12:09:00,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 82 transitions, 517 flow [2024-10-13 12:09:00,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:09:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:09:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-10-13 12:09:00,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-10-13 12:09:00,412 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 143 flow. Second operand 9 states and 144 transitions. [2024-10-13 12:09:00,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 82 transitions, 517 flow [2024-10-13 12:09:00,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 478 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-10-13 12:09:00,423 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 236 flow [2024-10-13 12:09:00,424 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2024-10-13 12:09:00,425 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-10-13 12:09:00,425 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 236 flow [2024-10-13 12:09:00,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-13 12:09:00,426 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:00,427 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:00,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:09:00,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:00,628 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-10-13 12:09:00,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1610009804, now seen corresponding path program 2 times [2024-10-13 12:09:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:00,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576883193] [2024-10-13 12:09:00,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:09:00,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:00,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:00,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:09:00,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:09:00,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:09:00,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:09:00,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:09:00,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:00,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:00,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:00,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576883193] [2024-10-13 12:09:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576883193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:00,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:00,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:09:00,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252724610] [2024-10-13 12:09:00,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:00,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:00,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:00,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:00,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:00,793 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:09:00,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-13 12:09:00,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:00,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:09:00,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:01,055 INFO L124 PetriNetUnfolderBase]: 346/655 cut-off events. [2024-10-13 12:09:01,056 INFO L125 PetriNetUnfolderBase]: For 2058/2058 co-relation queries the response was YES. [2024-10-13 12:09:01,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 655 events. 346/655 cut-off events. For 2058/2058 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2872 event pairs, 88 based on Foata normal form. 45/696 useless extension candidates. Maximal degree in co-relation 2166. Up to 273 conditions per place. [2024-10-13 12:09:01,062 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 12 changer transitions 30/86 dead transitions. [2024-10-13 12:09:01,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 655 flow [2024-10-13 12:09:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:09:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:09:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-10-13 12:09:01,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2024-10-13 12:09:01,064 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 236 flow. Second operand 9 states and 140 transitions. [2024-10-13 12:09:01,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 655 flow [2024-10-13 12:09:01,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 595 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-10-13 12:09:01,075 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 278 flow [2024-10-13 12:09:01,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2024-10-13 12:09:01,076 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-10-13 12:09:01,076 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 278 flow [2024-10-13 12:09:01,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-10-13 12:09:01,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:01,077 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:01,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 12:09:01,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:01,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:09:01,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:01,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1235422649, now seen corresponding path program 1 times [2024-10-13 12:09:01,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:01,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531116993] [2024-10-13 12:09:01,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:01,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:01,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:01,282 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:09:01,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:09:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:01,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:09:01,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:01,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:01,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:01,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531116993] [2024-10-13 12:09:01,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531116993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:01,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:01,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:01,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145599969] [2024-10-13 12:09:01,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:01,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:09:01,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:01,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:09:01,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:09:01,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:09:01,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:09:01,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:01,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:09:01,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:01,702 INFO L124 PetriNetUnfolderBase]: 427/806 cut-off events. [2024-10-13 12:09:01,703 INFO L125 PetriNetUnfolderBase]: For 3492/3492 co-relation queries the response was YES. [2024-10-13 12:09:01,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 806 events. 427/806 cut-off events. For 3492/3492 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3713 event pairs, 122 based on Foata normal form. 27/829 useless extension candidates. Maximal degree in co-relation 2874. Up to 316 conditions per place. [2024-10-13 12:09:01,710 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 51 selfloop transitions, 12 changer transitions 26/93 dead transitions. [2024-10-13 12:09:01,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 752 flow [2024-10-13 12:09:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:09:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:09:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-10-13 12:09:01,712 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2024-10-13 12:09:01,712 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 278 flow. Second operand 10 states and 158 transitions. [2024-10-13 12:09:01,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 752 flow [2024-10-13 12:09:01,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 718 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-10-13 12:09:01,721 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 345 flow [2024-10-13 12:09:01,721 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=345, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2024-10-13 12:09:01,721 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-10-13 12:09:01,722 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 345 flow [2024-10-13 12:09:01,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:09:01,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:01,722 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:01,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 12:09:01,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:01,926 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:09:01,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash -14089357, now seen corresponding path program 2 times [2024-10-13 12:09:01,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:01,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834724796] [2024-10-13 12:09:01,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:09:01,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:01,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:01,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:09:01,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:09:01,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:09:01,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:09:01,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:09:01,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:02,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:02,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:02,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834724796] [2024-10-13 12:09:02,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834724796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200990368] [2024-10-13 12:09:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:02,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:09:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:02,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:09:02,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:09:02,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:09:02,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 345 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:09:02,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:02,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:09:02,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:02,506 INFO L124 PetriNetUnfolderBase]: 463/891 cut-off events. [2024-10-13 12:09:02,507 INFO L125 PetriNetUnfolderBase]: For 6473/6473 co-relation queries the response was YES. [2024-10-13 12:09:02,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 891 events. 463/891 cut-off events. For 6473/6473 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4355 event pairs, 120 based on Foata normal form. 27/914 useless extension candidates. Maximal degree in co-relation 3577. Up to 340 conditions per place. [2024-10-13 12:09:02,518 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 56 selfloop transitions, 17 changer transitions 30/107 dead transitions. [2024-10-13 12:09:02,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 978 flow [2024-10-13 12:09:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:09:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:09:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-10-13 12:09:02,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-10-13 12:09:02,520 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 345 flow. Second operand 12 states and 186 transitions. [2024-10-13 12:09:02,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 978 flow [2024-10-13 12:09:02,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 842 flow, removed 59 selfloop flow, removed 7 redundant places. [2024-10-13 12:09:02,532 INFO L231 Difference]: Finished difference. Result has 75 places, 48 transitions, 395 flow [2024-10-13 12:09:02,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=395, PETRI_PLACES=75, PETRI_TRANSITIONS=48} [2024-10-13 12:09:02,533 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2024-10-13 12:09:02,533 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 48 transitions, 395 flow [2024-10-13 12:09:02,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:09:02,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:02,534 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:02,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 12:09:02,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:02,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:09:02,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 476818575, now seen corresponding path program 3 times [2024-10-13 12:09:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:02,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752414052] [2024-10-13 12:09:02,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:09:02,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:02,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:02,744 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:09:02,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 12:09:02,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-13 12:09:02,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:09:02,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:09:02,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:02,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:02,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:02,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752414052] [2024-10-13 12:09:02,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752414052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:02,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:02,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:02,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040338846] [2024-10-13 12:09:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:02,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:09:02,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:02,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:09:02,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:09:02,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:09:02,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 48 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:09:02,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:02,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:09:02,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:03,272 INFO L124 PetriNetUnfolderBase]: 436/839 cut-off events. [2024-10-13 12:09:03,272 INFO L125 PetriNetUnfolderBase]: For 6137/6137 co-relation queries the response was YES. [2024-10-13 12:09:03,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3329 conditions, 839 events. 436/839 cut-off events. For 6137/6137 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4049 event pairs, 152 based on Foata normal form. 27/862 useless extension candidates. Maximal degree in co-relation 3295. Up to 555 conditions per place. [2024-10-13 12:09:03,279 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 9 changer transitions 29/96 dead transitions. [2024-10-13 12:09:03,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 875 flow [2024-10-13 12:09:03,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:09:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:09:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2024-10-13 12:09:03,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2024-10-13 12:09:03,281 INFO L175 Difference]: Start difference. First operand has 75 places, 48 transitions, 395 flow. Second operand 10 states and 153 transitions. [2024-10-13 12:09:03,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 875 flow [2024-10-13 12:09:03,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 804 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-10-13 12:09:03,291 INFO L231 Difference]: Finished difference. Result has 79 places, 50 transitions, 405 flow [2024-10-13 12:09:03,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=405, PETRI_PLACES=79, PETRI_TRANSITIONS=50} [2024-10-13 12:09:03,292 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-10-13 12:09:03,292 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 50 transitions, 405 flow [2024-10-13 12:09:03,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:09:03,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:03,293 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:03,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 12:09:03,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:03,494 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:09:03,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1841714377, now seen corresponding path program 4 times [2024-10-13 12:09:03,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:03,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058661527] [2024-10-13 12:09:03,495 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:09:03,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:03,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:03,498 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:09:03,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 12:09:03,542 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:09:03,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:09:03,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:09:03,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:03,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-10-13 12:09:03,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:09:03,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:03,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058661527] [2024-10-13 12:09:03,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058661527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:03,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:03,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:03,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456468218] [2024-10-13 12:09:03,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:03,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:09:03,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:03,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:09:03,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:09:03,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:09:03,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 50 transitions, 405 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:09:03,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:03,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:09:03,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:03,927 INFO L124 PetriNetUnfolderBase]: 463/887 cut-off events. [2024-10-13 12:09:03,928 INFO L125 PetriNetUnfolderBase]: For 6613/6613 co-relation queries the response was YES. [2024-10-13 12:09:03,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3508 conditions, 887 events. 463/887 cut-off events. For 6613/6613 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4332 event pairs, 152 based on Foata normal form. 18/901 useless extension candidates. Maximal degree in co-relation 3472. Up to 456 conditions per place. [2024-10-13 12:09:03,937 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 16 changer transitions 21/95 dead transitions. [2024-10-13 12:09:03,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 95 transitions, 883 flow [2024-10-13 12:09:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:09:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:09:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-10-13 12:09:03,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2024-10-13 12:09:03,939 INFO L175 Difference]: Start difference. First operand has 79 places, 50 transitions, 405 flow. Second operand 9 states and 140 transitions. [2024-10-13 12:09:03,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 95 transitions, 883 flow [2024-10-13 12:09:03,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 827 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-10-13 12:09:03,955 INFO L231 Difference]: Finished difference. Result has 81 places, 53 transitions, 468 flow [2024-10-13 12:09:03,956 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=468, PETRI_PLACES=81, PETRI_TRANSITIONS=53} [2024-10-13 12:09:03,956 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2024-10-13 12:09:03,957 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 53 transitions, 468 flow [2024-10-13 12:09:03,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-10-13 12:09:03,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:03,957 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:03,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 12:09:04,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:04,161 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:09:04,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:04,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1638196562, now seen corresponding path program 1 times [2024-10-13 12:09:04,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:04,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546155923] [2024-10-13 12:09:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:04,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:04,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:04,164 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:09:04,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 12:09:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:04,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:09:04,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:04,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:09:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:04,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546155923] [2024-10-13 12:09:04,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546155923] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:09:04,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:09:04,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-13 12:09:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48755223] [2024-10-13 12:09:04,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:09:04,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:09:04,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:04,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:09:04,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:09:04,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:09:04,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 53 transitions, 468 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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-10-13 12:09:04,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:04,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:09:04,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:05,453 INFO L124 PetriNetUnfolderBase]: 697/1284 cut-off events. [2024-10-13 12:09:05,453 INFO L125 PetriNetUnfolderBase]: For 14498/14498 co-relation queries the response was YES. [2024-10-13 12:09:05,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5775 conditions, 1284 events. 697/1284 cut-off events. For 14498/14498 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6066 event pairs, 36 based on Foata normal form. 45/1325 useless extension candidates. Maximal degree in co-relation 5738. Up to 191 conditions per place. [2024-10-13 12:09:05,468 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 69 selfloop transitions, 43 changer transitions 60/176 dead transitions. [2024-10-13 12:09:05,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 176 transitions, 1752 flow [2024-10-13 12:09:05,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 12:09:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-13 12:09:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 323 transitions. [2024-10-13 12:09:05,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5303776683087028 [2024-10-13 12:09:05,471 INFO L175 Difference]: Start difference. First operand has 81 places, 53 transitions, 468 flow. Second operand 21 states and 323 transitions. [2024-10-13 12:09:05,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 176 transitions, 1752 flow [2024-10-13 12:09:05,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 176 transitions, 1659 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-10-13 12:09:05,496 INFO L231 Difference]: Finished difference. Result has 103 places, 69 transitions, 885 flow [2024-10-13 12:09:05,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=885, PETRI_PLACES=103, PETRI_TRANSITIONS=69} [2024-10-13 12:09:05,499 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-10-13 12:09:05,499 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 69 transitions, 885 flow [2024-10-13 12:09:05,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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-10-13 12:09:05,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:05,500 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:05,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-13 12:09:05,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:05,701 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:09:05,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash -389170009, now seen corresponding path program 1 times [2024-10-13 12:09:05,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:05,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368155548] [2024-10-13 12:09:05,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:05,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:05,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:05,704 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:09:05,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 12:09:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:05,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:09:05,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:05,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:09:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:06,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:06,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368155548] [2024-10-13 12:09:06,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368155548] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:09:06,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:09:06,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-13 12:09:06,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778949040] [2024-10-13 12:09:06,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:09:06,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:09:06,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:06,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:09:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:09:06,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:09:06,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 69 transitions, 885 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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-10-13 12:09:06,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:06,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:09:06,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:06,816 INFO L124 PetriNetUnfolderBase]: 787/1487 cut-off events. [2024-10-13 12:09:06,816 INFO L125 PetriNetUnfolderBase]: For 27581/27581 co-relation queries the response was YES. [2024-10-13 12:09:06,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7600 conditions, 1487 events. 787/1487 cut-off events. For 27581/27581 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7270 event pairs, 239 based on Foata normal form. 63/1546 useless extension candidates. Maximal degree in co-relation 7555. Up to 828 conditions per place. [2024-10-13 12:09:06,832 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 85 selfloop transitions, 19 changer transitions 67/175 dead transitions. [2024-10-13 12:09:06,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 175 transitions, 2251 flow [2024-10-13 12:09:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 12:09:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-13 12:09:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2024-10-13 12:09:06,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5226860254083484 [2024-10-13 12:09:06,835 INFO L175 Difference]: Start difference. First operand has 103 places, 69 transitions, 885 flow. Second operand 19 states and 288 transitions. [2024-10-13 12:09:06,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 175 transitions, 2251 flow [2024-10-13 12:09:06,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 175 transitions, 1697 flow, removed 258 selfloop flow, removed 14 redundant places. [2024-10-13 12:09:06,878 INFO L231 Difference]: Finished difference. Result has 115 places, 75 transitions, 766 flow [2024-10-13 12:09:06,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=766, PETRI_PLACES=115, PETRI_TRANSITIONS=75} [2024-10-13 12:09:06,880 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2024-10-13 12:09:06,880 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 75 transitions, 766 flow [2024-10-13 12:09:06,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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-10-13 12:09:06,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:06,881 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:06,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 12:09:07,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:07,082 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:09:07,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:07,082 INFO L85 PathProgramCache]: Analyzing trace with hash -295210743, now seen corresponding path program 2 times [2024-10-13 12:09:07,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:07,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558080513] [2024-10-13 12:09:07,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:09:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:07,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:07,084 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:09:07,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 12:09:07,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:09:07,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:09:07,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:09:07,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:07,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:09:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:07,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:07,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558080513] [2024-10-13 12:09:07,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558080513] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:09:07,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:09:07,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-13 12:09:07,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865924687] [2024-10-13 12:09:07,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:09:07,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:09:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:07,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:09:07,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:09:07,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:09:07,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 75 transitions, 766 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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-10-13 12:09:07,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:07,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:09:07,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:08,741 INFO L124 PetriNetUnfolderBase]: 1246/2341 cut-off events. [2024-10-13 12:09:08,742 INFO L125 PetriNetUnfolderBase]: For 56993/56993 co-relation queries the response was YES. [2024-10-13 12:09:08,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13174 conditions, 2341 events. 1246/2341 cut-off events. For 56993/56993 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12828 event pairs, 88 based on Foata normal form. 63/2400 useless extension candidates. Maximal degree in co-relation 13124. Up to 478 conditions per place. [2024-10-13 12:09:08,771 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 129 selfloop transitions, 54 changer transitions 59/246 dead transitions. [2024-10-13 12:09:08,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 246 transitions, 3242 flow [2024-10-13 12:09:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 12:09:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-10-13 12:09:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 421 transitions. [2024-10-13 12:09:08,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5376756066411239 [2024-10-13 12:09:08,774 INFO L175 Difference]: Start difference. First operand has 115 places, 75 transitions, 766 flow. Second operand 27 states and 421 transitions. [2024-10-13 12:09:08,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 246 transitions, 3242 flow [2024-10-13 12:09:08,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 246 transitions, 2735 flow, removed 241 selfloop flow, removed 12 redundant places. [2024-10-13 12:09:08,826 INFO L231 Difference]: Finished difference. Result has 139 places, 97 transitions, 1308 flow [2024-10-13 12:09:08,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1308, PETRI_PLACES=139, PETRI_TRANSITIONS=97} [2024-10-13 12:09:08,827 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-10-13 12:09:08,827 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 97 transitions, 1308 flow [2024-10-13 12:09:08,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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-10-13 12:09:08,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:08,827 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:08,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 12:09:09,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:09,028 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:09:09,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:09,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1659104887, now seen corresponding path program 3 times [2024-10-13 12:09:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:09,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895706922] [2024-10-13 12:09:09,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:09:09,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:09,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:09,033 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:09:09,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 12:09:09,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 12:09:09,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:09:09,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:09:09,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:09,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:09:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:09,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:09,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895706922] [2024-10-13 12:09:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895706922] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:09:09,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:09:09,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-13 12:09:09,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564876800] [2024-10-13 12:09:09,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:09:09,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:09:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:09:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:09:09,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:09:09,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 97 transitions, 1308 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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-10-13 12:09:09,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:09,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:09:09,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:10,568 INFO L124 PetriNetUnfolderBase]: 1318/2463 cut-off events. [2024-10-13 12:09:10,568 INFO L125 PetriNetUnfolderBase]: For 90317/90317 co-relation queries the response was YES. [2024-10-13 12:09:10,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15105 conditions, 2463 events. 1318/2463 cut-off events. For 90317/90317 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 13451 event pairs, 122 based on Foata normal form. 162/2621 useless extension candidates. Maximal degree in co-relation 15045. Up to 454 conditions per place. [2024-10-13 12:09:10,594 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 99 selfloop transitions, 68 changer transitions 95/266 dead transitions. [2024-10-13 12:09:10,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 266 transitions, 4146 flow [2024-10-13 12:09:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 12:09:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-10-13 12:09:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 383 transitions. [2024-10-13 12:09:10,597 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5282758620689655 [2024-10-13 12:09:10,597 INFO L175 Difference]: Start difference. First operand has 139 places, 97 transitions, 1308 flow. Second operand 25 states and 383 transitions. [2024-10-13 12:09:10,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 266 transitions, 4146 flow [2024-10-13 12:09:10,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 266 transitions, 3311 flow, removed 402 selfloop flow, removed 14 redundant places. [2024-10-13 12:09:10,686 INFO L231 Difference]: Finished difference. Result has 158 places, 115 transitions, 1613 flow [2024-10-13 12:09:10,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1613, PETRI_PLACES=158, PETRI_TRANSITIONS=115} [2024-10-13 12:09:10,687 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 128 predicate places. [2024-10-13 12:09:10,687 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 115 transitions, 1613 flow [2024-10-13 12:09:10,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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-10-13 12:09:10,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:10,688 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:10,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 12:09:10,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:10,889 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:09:10,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:10,889 INFO L85 PathProgramCache]: Analyzing trace with hash -627287686, now seen corresponding path program 1 times [2024-10-13 12:09:10,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520045282] [2024-10-13 12:09:10,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:10,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:10,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:10,891 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:09:10,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 12:09:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:10,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:09:10,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:09:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:09:11,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:09:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:09:11,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:09:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520045282] [2024-10-13 12:09:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520045282] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:09:11,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:09:11,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-13 12:09:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365332531] [2024-10-13 12:09:11,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:09:11,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 12:09:11,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:09:11,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 12:09:11,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-13 12:09:11,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-10-13 12:09:11,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 115 transitions, 1613 flow. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 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-10-13 12:09:11,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:11,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-10-13 12:09:11,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:13,384 INFO L124 PetriNetUnfolderBase]: 1687/3115 cut-off events. [2024-10-13 12:09:13,384 INFO L125 PetriNetUnfolderBase]: For 123387/123387 co-relation queries the response was YES. [2024-10-13 12:09:13,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19174 conditions, 3115 events. 1687/3115 cut-off events. For 123387/123387 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 16798 event pairs, 48 based on Foata normal form. 72/3183 useless extension candidates. Maximal degree in co-relation 19107. Up to 477 conditions per place. [2024-10-13 12:09:13,422 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 125 selfloop transitions, 111 changer transitions 105/345 dead transitions. [2024-10-13 12:09:13,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 345 transitions, 5341 flow [2024-10-13 12:09:13,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-13 12:09:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-10-13 12:09:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 551 transitions. [2024-10-13 12:09:13,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-10-13 12:09:13,427 INFO L175 Difference]: Start difference. First operand has 158 places, 115 transitions, 1613 flow. Second operand 36 states and 551 transitions. [2024-10-13 12:09:13,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 345 transitions, 5341 flow [2024-10-13 12:09:13,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 345 transitions, 4700 flow, removed 296 selfloop flow, removed 19 redundant places. [2024-10-13 12:09:13,674 INFO L231 Difference]: Finished difference. Result has 186 places, 154 transitions, 2535 flow [2024-10-13 12:09:13,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2535, PETRI_PLACES=186, PETRI_TRANSITIONS=154} [2024-10-13 12:09:13,675 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2024-10-13 12:09:13,675 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 154 transitions, 2535 flow [2024-10-13 12:09:13,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 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-10-13 12:09:13,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:13,676 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:13,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-13 12:09:13,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:13,876 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:09:13,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:13,877 INFO L85 PathProgramCache]: Analyzing trace with hash 291804209, now seen corresponding path program 2 times [2024-10-13 12:09:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:09:13,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301198289] [2024-10-13 12:09:13,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:09:13,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:13,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:09:13,880 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:09:13,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 12:09:13,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:09:13,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 12:09:13,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:09:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:09:13,992 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:09:13,992 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:09:13,993 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-10-13 12:09:14,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-10-13 12:09:14,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-13 12:09:14,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-10-13 12:09:14,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 12:09:14,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:09:14,202 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1] [2024-10-13 12:09:14,264 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:09:14,265 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:09:14,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:09:14 BasicIcfg [2024-10-13 12:09:14,269 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:09:14,269 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:09:14,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:09:14,270 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:09:14,270 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:08:57" (3/4) ... [2024-10-13 12:09:14,272 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:09:14,273 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:09:14,273 INFO L158 Benchmark]: Toolchain (without parser) took 17544.76ms. Allocated memory was 65.0MB in the beginning and 339.7MB in the end (delta: 274.7MB). Free memory was 42.6MB in the beginning and 172.2MB in the end (delta: -129.6MB). Peak memory consumption was 144.3MB. Max. memory is 16.1GB. [2024-10-13 12:09:14,274 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 41.9MB. Free memory was 23.1MB in the beginning and 23.1MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:09:14,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.52ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 40.4MB in the end (delta: 2.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-13 12:09:14,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.74ms. Allocated memory is still 65.0MB. Free memory was 40.1MB in the beginning and 38.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:09:14,274 INFO L158 Benchmark]: Boogie Preprocessor took 50.97ms. Allocated memory is still 65.0MB. Free memory was 38.2MB in the beginning and 35.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:09:14,275 INFO L158 Benchmark]: RCFGBuilder took 557.67ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 35.8MB in the beginning and 61.8MB in the end (delta: -25.9MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-10-13 12:09:14,275 INFO L158 Benchmark]: TraceAbstraction took 16347.32ms. Allocated memory was 92.3MB in the beginning and 339.7MB in the end (delta: 247.5MB). Free memory was 60.7MB in the beginning and 173.3MB in the end (delta: -112.6MB). Peak memory consumption was 134.4MB. Max. memory is 16.1GB. [2024-10-13 12:09:14,275 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 339.7MB. Free memory was 173.3MB in the beginning and 172.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:09:14,277 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 41.9MB. Free memory was 23.1MB in the beginning and 23.1MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.52ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 40.4MB in the end (delta: 2.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.74ms. Allocated memory is still 65.0MB. Free memory was 40.1MB in the beginning and 38.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.97ms. Allocated memory is still 65.0MB. Free memory was 38.2MB in the beginning and 35.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 557.67ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 35.8MB in the beginning and 61.8MB in the end (delta: -25.9MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16347.32ms. Allocated memory was 92.3MB in the beginning and 339.7MB in the end (delta: 247.5MB). Free memory was 60.7MB in the beginning and 173.3MB in the end (delta: -112.6MB). Peak memory consumption was 134.4MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 339.7MB. Free memory was 173.3MB in the beginning and 172.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 693]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 693. Possible FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, argc=17, i=3, id1=0, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, arg={0:0}, argc=17, i=3, id1=0, id2=1, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, arg={0:0}, arg={0:0}, argc=17, condI=0, i=7, id1=0, id2=1, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, arg={0:0}, arg={0:0}, argc=17, condI=0, condJ=1, i=15, id1=0, id2=1, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ [L722] CALL 0 reach_error() [L693] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L693] 0 __assert_fail ("0", "triangular-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] - UnprovableResult [Line: 711]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.2s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1701 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1681 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4443 IncrementalHoareTripleChecker+Invalid, 4526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 11 mSDtfsCounter, 4443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2535occurred in iteration=14, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 1930 SizeOfPredicates, 44 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 4/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 12:09:14,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample