./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/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-assert-order-craig-3061b6d-m [2024-11-19 09:20:29,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:20:29,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:20:29,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:20:29,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:20:29,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:20:29,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:20:29,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:20:29,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:20:29,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:20:29,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:20:29,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:20:29,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:20:29,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:20:29,165 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:20:29,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:20:29,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:20:29,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:20:29,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:20:29,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:20:29,166 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:20:29,170 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:20:29,170 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:20:29,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:20:29,171 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:20:29,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:20:29,171 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:20:29,172 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:20:29,172 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:20:29,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:20:29,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:20:29,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:20:29,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:20:29,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:20:29,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:20:29,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:20:29,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:20:29,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:20:29,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:20:29,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:20:29,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:20:29,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:20:29,176 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-11-19 09:20:29,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:20:29,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:20:29,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:20:29,451 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:20:29,451 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:20:29,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2024-11-19 09:20:30,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:20:31,155 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:20:31,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-11-19 09:20:31,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51af0330d/d8846596e59541f4aff092dbd8eb2ee6/FLAG4e4510286 [2024-11-19 09:20:31,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51af0330d/d8846596e59541f4aff092dbd8eb2ee6 [2024-11-19 09:20:31,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:20:31,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:20:31,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:20:31,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:20:31,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:20:31,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:20:31" (1/1) ... [2024-11-19 09:20:31,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2d9702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:31, skipping insertion in model container [2024-11-19 09:20:31,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:20:31" (1/1) ... [2024-11-19 09:20:31,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:20:32,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:20:32,056 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:20:32,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:20:32,144 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:20:32,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32 WrapperNode [2024-11-19 09:20:32,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:20:32,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:20:32,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:20:32,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:20:32,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,199 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-11-19 09:20:32,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:20:32,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:20:32,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:20:32,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:20:32,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,236 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 09:20:32,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:20:32,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:20:32,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:20:32,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:20:32,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (1/1) ... [2024-11-19 09:20:32,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:20:32,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:32,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:20:32,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:20:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-19 09:20:32,354 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-19 09:20:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-19 09:20:32,354 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-19 09:20:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:20:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:20:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:20:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:20:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:20:32,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:20:32,357 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:20:32,499 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:20:32,501 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:20:32,623 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:20:32,623 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:20:32,719 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:20:32,720 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:20:32,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:20:32 BoogieIcfgContainer [2024-11-19 09:20:32,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:20:32,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:20:32,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:20:32,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:20:32,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:20:31" (1/3) ... [2024-11-19 09:20:32,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c67d032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:20:32, skipping insertion in model container [2024-11-19 09:20:32,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:32" (2/3) ... [2024-11-19 09:20:32,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c67d032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:20:32, skipping insertion in model container [2024-11-19 09:20:32,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:20:32" (3/3) ... [2024-11-19 09:20:32,730 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-11-19 09:20:32,749 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:20:32,749 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:20:32,749 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:20:32,808 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:20:32,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2024-11-19 09:20:32,886 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-19 09:20:32,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:20:32,890 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-11-19 09:20:32,890 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2024-11-19 09:20:32,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2024-11-19 09:20:32,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:20:32,914 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;@768daa8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:20:32,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 09:20:32,947 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:20:32,948 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-11-19 09:20:32,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:20:32,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:32,949 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:32,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 09:20:32,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1038261642, now seen corresponding path program 1 times [2024-11-19 09:20:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:32,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096644188] [2024-11-19 09:20:32,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:33,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:33,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096644188] [2024-11-19 09:20:33,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096644188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:33,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:33,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:20:33,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627755065] [2024-11-19 09:20:33,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:33,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:20:33,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:20:33,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:20:33,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2024-11-19 09:20:33,286 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-11-19 09:20:33,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:33,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2024-11-19 09:20:33,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:33,367 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2024-11-19 09:20:33,368 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:20:33,369 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-11-19 09:20:33,375 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2024-11-19 09:20:33,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2024-11-19 09:20:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:20:33,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:20:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-11-19 09:20:33,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-11-19 09:20:33,393 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2024-11-19 09:20:33,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2024-11-19 09:20:33,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:20:33,399 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2024-11-19 09:20:33,401 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-11-19 09:20:33,407 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2024-11-19 09:20:33,407 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2024-11-19 09:20:33,407 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-11-19 09:20:33,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:33,408 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:33,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:20:33,408 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-11-19 09:20:33,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:33,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1038262774, now seen corresponding path program 1 times [2024-11-19 09:20:33,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:33,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398139951] [2024-11-19 09:20:33,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:33,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398139951] [2024-11-19 09:20:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398139951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:33,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:20:33,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058588568] [2024-11-19 09:20:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:33,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:20:33,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:33,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:20:33,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:20:33,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:33,725 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-11-19 09:20:33,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:33,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:33,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:33,944 INFO L124 PetriNetUnfolderBase]: 273/487 cut-off events. [2024-11-19 09:20:33,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:20:33,946 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-11-19 09:20:33,951 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 4 changer transitions 21/54 dead transitions. [2024-11-19 09:20:33,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 54 transitions, 212 flow [2024-11-19 09:20:33,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:20:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:20:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-11-19 09:20:33,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2024-11-19 09:20:33,954 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 6 states and 99 transitions. [2024-11-19 09:20:33,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 54 transitions, 212 flow [2024-11-19 09:20:33,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:20:33,958 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 74 flow [2024-11-19 09:20:33,958 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-11-19 09:20:33,959 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2024-11-19 09:20:33,959 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 74 flow [2024-11-19 09:20:33,960 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-11-19 09:20:33,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:33,960 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:33,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:20:33,961 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-11-19 09:20:33,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:33,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1117686194, now seen corresponding path program 1 times [2024-11-19 09:20:33,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:33,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555109030] [2024-11-19 09:20:33,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:33,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:34,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:34,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555109030] [2024-11-19 09:20:34,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555109030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:34,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:34,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:20:34,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983782622] [2024-11-19 09:20:34,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:34,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:20:34,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:34,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:20:34,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:20:34,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:34,199 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-11-19 09:20:34,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:34,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:34,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:34,466 INFO L124 PetriNetUnfolderBase]: 382/704 cut-off events. [2024-11-19 09:20:34,467 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2024-11-19 09:20:34,471 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-11-19 09:20:34,477 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 9 changer transitions 20/79 dead transitions. [2024-11-19 09:20:34,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 382 flow [2024-11-19 09:20:34,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:20:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:20:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-11-19 09:20:34,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-11-19 09:20:34,501 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 74 flow. Second operand 9 states and 144 transitions. [2024-11-19 09:20:34,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 382 flow [2024-11-19 09:20:34,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 366 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-19 09:20:34,514 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 159 flow [2024-11-19 09:20:34,514 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-11-19 09:20:34,514 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2024-11-19 09:20:34,515 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 159 flow [2024-11-19 09:20:34,515 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-11-19 09:20:34,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:34,515 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:34,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:20:34,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 09:20:34,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1000674482, now seen corresponding path program 2 times [2024-11-19 09:20:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:34,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935217727] [2024-11-19 09:20:34,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:20:34,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:34,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:20:34,568 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:34,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:34,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935217727] [2024-11-19 09:20:34,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935217727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:34,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:34,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:20:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409904977] [2024-11-19 09:20:34,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:34,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:20:34,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:34,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:20:34,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:20:34,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:34,735 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-11-19 09:20:34,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:34,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:34,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:34,946 INFO L124 PetriNetUnfolderBase]: 328/611 cut-off events. [2024-11-19 09:20:34,947 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2024-11-19 09:20:34,949 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-11-19 09:20:34,952 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 9 changer transitions 28/79 dead transitions. [2024-11-19 09:20:34,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 499 flow [2024-11-19 09:20:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:20:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:20:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-11-19 09:20:34,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5474137931034483 [2024-11-19 09:20:34,954 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 159 flow. Second operand 8 states and 127 transitions. [2024-11-19 09:20:34,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 499 flow [2024-11-19 09:20:34,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 491 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-19 09:20:34,962 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 213 flow [2024-11-19 09:20:34,962 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-11-19 09:20:34,963 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-11-19 09:20:34,963 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 213 flow [2024-11-19 09:20:34,963 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-11-19 09:20:34,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:34,964 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:34,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:20:34,964 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 09:20:34,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:34,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1356857717, now seen corresponding path program 1 times [2024-11-19 09:20:34,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:34,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091441146] [2024-11-19 09:20:34,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:34,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091441146] [2024-11-19 09:20:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091441146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:35,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:35,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:20:35,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387233308] [2024-11-19 09:20:35,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:35,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:20:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:35,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:20:35,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:20:35,107 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:35,108 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-11-19 09:20:35,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:35,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:35,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:35,391 INFO L124 PetriNetUnfolderBase]: 337/620 cut-off events. [2024-11-19 09:20:35,392 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2024-11-19 09:20:35,393 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-11-19 09:20:35,410 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 16 changer transitions 24/90 dead transitions. [2024-11-19 09:20:35,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 610 flow [2024-11-19 09:20:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:20:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:20:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-11-19 09:20:35,412 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2024-11-19 09:20:35,413 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 213 flow. Second operand 11 states and 168 transitions. [2024-11-19 09:20:35,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 610 flow [2024-11-19 09:20:35,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 543 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-11-19 09:20:35,420 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 282 flow [2024-11-19 09:20:35,420 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-11-19 09:20:35,421 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-11-19 09:20:35,421 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 282 flow [2024-11-19 09:20:35,422 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-11-19 09:20:35,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:35,422 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:35,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:20:35,422 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-11-19 09:20:35,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:35,423 INFO L85 PathProgramCache]: Analyzing trace with hash 392343623, now seen corresponding path program 2 times [2024-11-19 09:20:35,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:35,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172774726] [2024-11-19 09:20:35,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:20:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:35,433 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:20:35,433 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:35,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:35,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172774726] [2024-11-19 09:20:35,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172774726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:35,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:35,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:20:35,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815089329] [2024-11-19 09:20:35,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:35,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:20:35,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:35,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:20:35,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:20:35,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:35,569 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-11-19 09:20:35,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:35,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:35,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:35,820 INFO L124 PetriNetUnfolderBase]: 445/807 cut-off events. [2024-11-19 09:20:35,820 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2024-11-19 09:20:35,822 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-11-19 09:20:35,825 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 44 selfloop transitions, 23 changer transitions 30/101 dead transitions. [2024-11-19 09:20:35,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 101 transitions, 742 flow [2024-11-19 09:20:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:20:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:20:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2024-11-19 09:20:35,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5360501567398119 [2024-11-19 09:20:35,827 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 282 flow. Second operand 11 states and 171 transitions. [2024-11-19 09:20:35,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 101 transitions, 742 flow [2024-11-19 09:20:35,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 688 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-11-19 09:20:35,837 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 393 flow [2024-11-19 09:20:35,838 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-11-19 09:20:35,838 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-11-19 09:20:35,838 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 393 flow [2024-11-19 09:20:35,839 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-11-19 09:20:35,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:35,839 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:35,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:20:35,840 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-11-19 09:20:35,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1383133169, now seen corresponding path program 1 times [2024-11-19 09:20:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:35,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350972258] [2024-11-19 09:20:35,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:35,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:35,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350972258] [2024-11-19 09:20:35,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350972258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:35,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717043157] [2024-11-19 09:20:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:35,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:35,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:35,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:35,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:20:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:36,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:20:36,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:36,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:36,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717043157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:36,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:20:36,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-19 09:20:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453880406] [2024-11-19 09:20:36,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:36,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:20:36,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:36,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:20:36,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:20:36,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:36,321 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-11-19 09:20:36,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:36,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:36,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:36,807 INFO L124 PetriNetUnfolderBase]: 571/1058 cut-off events. [2024-11-19 09:20:36,808 INFO L125 PetriNetUnfolderBase]: For 6872/6872 co-relation queries the response was YES. [2024-11-19 09:20:36,811 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-11-19 09:20:36,815 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 64 selfloop transitions, 17 changer transitions 67/152 dead transitions. [2024-11-19 09:20:36,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 152 transitions, 1349 flow [2024-11-19 09:20:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:20:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-19 09:20:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2024-11-19 09:20:36,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5226860254083484 [2024-11-19 09:20:36,817 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 393 flow. Second operand 19 states and 288 transitions. [2024-11-19 09:20:36,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 152 transitions, 1349 flow [2024-11-19 09:20:36,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 152 transitions, 1270 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-11-19 09:20:36,829 INFO L231 Difference]: Finished difference. Result has 90 places, 52 transitions, 524 flow [2024-11-19 09:20:36,830 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-11-19 09:20:36,830 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2024-11-19 09:20:36,831 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 52 transitions, 524 flow [2024-11-19 09:20:36,831 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-11-19 09:20:36,831 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:36,831 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:36,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:20:37,032 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-11-19 09:20:37,032 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-11-19 09:20:37,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1985942713, now seen corresponding path program 2 times [2024-11-19 09:20:37,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:37,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482396293] [2024-11-19 09:20:37,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:20:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:37,045 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:20:37,045 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482396293] [2024-11-19 09:20:37,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482396293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:37,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313402801] [2024-11-19 09:20:37,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:20:37,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:37,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:37,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:37,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:20:37,234 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:20:37,234 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:37,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:20:37,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:37,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313402801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:37,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:20:37,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-19 09:20:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989787481] [2024-11-19 09:20:37,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:37,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:20:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:37,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:20:37,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:20:37,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:37,429 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-11-19 09:20:37,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:37,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:37,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:38,181 INFO L124 PetriNetUnfolderBase]: 877/1628 cut-off events. [2024-11-19 09:20:38,182 INFO L125 PetriNetUnfolderBase]: For 29480/29480 co-relation queries the response was YES. [2024-11-19 09:20:38,189 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-11-19 09:20:38,199 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 88 selfloop transitions, 46 changer transitions 80/218 dead transitions. [2024-11-19 09:20:38,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 218 transitions, 2565 flow [2024-11-19 09:20:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 09:20:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-19 09:20:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 415 transitions. [2024-11-19 09:20:38,202 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5300127713920817 [2024-11-19 09:20:38,202 INFO L175 Difference]: Start difference. First operand has 90 places, 52 transitions, 524 flow. Second operand 27 states and 415 transitions. [2024-11-19 09:20:38,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 218 transitions, 2565 flow [2024-11-19 09:20:38,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 218 transitions, 2089 flow, removed 227 selfloop flow, removed 12 redundant places. [2024-11-19 09:20:38,231 INFO L231 Difference]: Finished difference. Result has 116 places, 70 transitions, 908 flow [2024-11-19 09:20:38,232 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-11-19 09:20:38,234 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2024-11-19 09:20:38,235 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 70 transitions, 908 flow [2024-11-19 09:20:38,235 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-11-19 09:20:38,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:38,235 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:38,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 09:20:38,435 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-11-19 09:20:38,436 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-11-19 09:20:38,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1216840336, now seen corresponding path program 1 times [2024-11-19 09:20:38,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:38,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165336231] [2024-11-19 09:20:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:38,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165336231] [2024-11-19 09:20:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165336231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561013615] [2024-11-19 09:20:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:38,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:38,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:38,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:38,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:20:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:38,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:20:38,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:38,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:38,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561013615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:38,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:20:38,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-19 09:20:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892935594] [2024-11-19 09:20:38,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:38,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:20:38,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:38,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:20:38,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:20:38,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:38,900 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-11-19 09:20:38,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:38,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:38,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:39,794 INFO L124 PetriNetUnfolderBase]: 1093/2114 cut-off events. [2024-11-19 09:20:39,795 INFO L125 PetriNetUnfolderBase]: For 73277/73277 co-relation queries the response was YES. [2024-11-19 09:20:39,804 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-11-19 09:20:39,818 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 86 selfloop transitions, 64 changer transitions 88/242 dead transitions. [2024-11-19 09:20:39,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 242 transitions, 3738 flow [2024-11-19 09:20:39,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 09:20:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-19 09:20:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 425 transitions. [2024-11-19 09:20:39,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5233990147783252 [2024-11-19 09:20:39,822 INFO L175 Difference]: Start difference. First operand has 116 places, 70 transitions, 908 flow. Second operand 28 states and 425 transitions. [2024-11-19 09:20:39,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 242 transitions, 3738 flow [2024-11-19 09:20:39,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 242 transitions, 3143 flow, removed 281 selfloop flow, removed 15 redundant places. [2024-11-19 09:20:39,901 INFO L231 Difference]: Finished difference. Result has 138 places, 92 transitions, 1417 flow [2024-11-19 09:20:39,901 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-11-19 09:20:39,902 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2024-11-19 09:20:39,902 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 92 transitions, 1417 flow [2024-11-19 09:20:39,902 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-11-19 09:20:39,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:39,902 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:39,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 09:20:40,106 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-11-19 09:20:40,107 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-11-19 09:20:40,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash -974308042, now seen corresponding path program 2 times [2024-11-19 09:20:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:40,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769134435] [2024-11-19 09:20:40,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:20:40,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:40,121 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:20:40,121 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:40,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:40,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769134435] [2024-11-19 09:20:40,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769134435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:40,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927611462] [2024-11-19 09:20:40,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:20:40,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:40,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:40,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:40,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:20:40,309 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:20:40,309 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:40,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:20:40,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:40,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:40,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927611462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:40,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:20:40,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-19 09:20:40,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601324545] [2024-11-19 09:20:40,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:40,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:20:40,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:40,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:20:40,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-19 09:20:40,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:40,520 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-11-19 09:20:40,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:40,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:40,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:41,847 INFO L124 PetriNetUnfolderBase]: 1399/2654 cut-off events. [2024-11-19 09:20:41,849 INFO L125 PetriNetUnfolderBase]: For 156808/156808 co-relation queries the response was YES. [2024-11-19 09:20:41,864 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-11-19 09:20:41,884 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 112 selfloop transitions, 95 changer transitions 113/324 dead transitions. [2024-11-19 09:20:41,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 324 transitions, 6002 flow [2024-11-19 09:20:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-19 09:20:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-19 09:20:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 551 transitions. [2024-11-19 09:20:41,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-11-19 09:20:41,890 INFO L175 Difference]: Start difference. First operand has 138 places, 92 transitions, 1417 flow. Second operand 36 states and 551 transitions. [2024-11-19 09:20:41,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 324 transitions, 6002 flow [2024-11-19 09:20:42,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 324 transitions, 5013 flow, removed 469 selfloop flow, removed 16 redundant places. [2024-11-19 09:20:42,123 INFO L231 Difference]: Finished difference. Result has 172 places, 120 transitions, 2180 flow [2024-11-19 09:20:42,124 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-11-19 09:20:42,125 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-11-19 09:20:42,125 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 120 transitions, 2180 flow [2024-11-19 09:20:42,126 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-11-19 09:20:42,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:42,126 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:42,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 09:20:42,326 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-11-19 09:20:42,327 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-11-19 09:20:42,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:42,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1191975869, now seen corresponding path program 3 times [2024-11-19 09:20:42,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:42,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682729318] [2024-11-19 09:20:42,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:20:42,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:42,345 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 09:20:42,346 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:42,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:42,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682729318] [2024-11-19 09:20:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682729318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:42,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799366995] [2024-11-19 09:20:42,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:20:42,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:42,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:42,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:42,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 09:20:42,633 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 09:20:42,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:42,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:20:42,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:42,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:42,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799366995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:42,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:20:42,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2024-11-19 09:20:42,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702153633] [2024-11-19 09:20:42,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:42,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:20:42,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:42,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:20:42,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:20:42,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:42,880 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-11-19 09:20:42,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:42,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:42,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:43,926 INFO L124 PetriNetUnfolderBase]: 1444/2765 cut-off events. [2024-11-19 09:20:43,927 INFO L125 PetriNetUnfolderBase]: For 202456/202456 co-relation queries the response was YES. [2024-11-19 09:20:43,942 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-11-19 09:20:43,959 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 104 selfloop transitions, 98 changer transitions 51/257 dead transitions. [2024-11-19 09:20:43,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 257 transitions, 4926 flow [2024-11-19 09:20:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 09:20:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-19 09:20:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 365 transitions. [2024-11-19 09:20:43,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5244252873563219 [2024-11-19 09:20:43,961 INFO L175 Difference]: Start difference. First operand has 172 places, 120 transitions, 2180 flow. Second operand 24 states and 365 transitions. [2024-11-19 09:20:43,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 257 transitions, 4926 flow [2024-11-19 09:20:44,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 257 transitions, 3755 flow, removed 551 selfloop flow, removed 24 redundant places. [2024-11-19 09:20:44,331 INFO L231 Difference]: Finished difference. Result has 172 places, 133 transitions, 2094 flow [2024-11-19 09:20:44,331 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-11-19 09:20:44,332 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-11-19 09:20:44,332 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 133 transitions, 2094 flow [2024-11-19 09:20:44,332 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-11-19 09:20:44,332 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:44,332 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:44,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 09:20:44,536 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-11-19 09:20:44,537 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-11-19 09:20:44,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1362475303, now seen corresponding path program 4 times [2024-11-19 09:20:44,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:44,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984860261] [2024-11-19 09:20:44,538 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:20:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:44,554 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:20:44,555 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:20:44,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:20:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:20:44,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:20:44,604 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:20:44,605 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-19 09:20:44,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-19 09:20:44,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-19 09:20:44,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-19 09:20:44,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:20:44,609 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1] [2024-11-19 09:20:44,683 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:20:44,683 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:20:44,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:20:44 BasicIcfg [2024-11-19 09:20:44,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:20:44,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:20:44,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:20:44,690 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:20:44,690 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:20:32" (3/4) ... [2024-11-19 09:20:44,693 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:20:44,694 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:20:44,695 INFO L158 Benchmark]: Toolchain (without parser) took 13213.74ms. Allocated memory was 148.9MB in the beginning and 308.3MB in the end (delta: 159.4MB). Free memory was 94.2MB in the beginning and 143.7MB in the end (delta: -49.4MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. [2024-11-19 09:20:44,695 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:20:44,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.48ms. Allocated memory is still 148.9MB. Free memory was 93.8MB in the beginning and 106.5MB in the end (delta: -12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 09:20:44,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.24ms. Allocated memory is still 148.9MB. Free memory was 106.5MB in the beginning and 104.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:20:44,696 INFO L158 Benchmark]: Boogie Preprocessor took 56.28ms. Allocated memory is still 148.9MB. Free memory was 104.5MB in the beginning and 102.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:20:44,696 INFO L158 Benchmark]: RCFGBuilder took 462.88ms. Allocated memory is still 148.9MB. Free memory was 102.4MB in the beginning and 84.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 09:20:44,697 INFO L158 Benchmark]: TraceAbstraction took 11966.81ms. Allocated memory was 148.9MB in the beginning and 308.3MB in the end (delta: 159.4MB). Free memory was 83.5MB in the beginning and 143.7MB in the end (delta: -60.2MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2024-11-19 09:20:44,697 INFO L158 Benchmark]: Witness Printer took 4.65ms. Allocated memory is still 308.3MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:20:44,698 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.48ms. Allocated memory is still 148.9MB. Free memory was 93.8MB in the beginning and 106.5MB in the end (delta: -12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.24ms. Allocated memory is still 148.9MB. Free memory was 106.5MB in the beginning and 104.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.28ms. Allocated memory is still 148.9MB. Free memory was 104.5MB in the beginning and 102.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 462.88ms. Allocated memory is still 148.9MB. Free memory was 102.4MB in the beginning and 84.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11966.81ms. Allocated memory was 148.9MB in the beginning and 308.3MB in the end (delta: 159.4MB). Free memory was 83.5MB in the beginning and 143.7MB in the end (delta: -60.2MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. * Witness Printer took 4.65ms. Allocated memory is still 308.3MB. Free memory is still 143.7MB. 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.8s, 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.4s 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, 32 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-11-19 09:20:44,732 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/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-assert-order-craig-3061b6d-m [2024-11-19 09:20:47,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:20:47,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:20:47,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:20:47,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:20:47,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:20:47,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:20:47,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:20:47,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:20:47,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:20:47,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:20:47,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:20:47,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:20:47,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:20:47,250 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:20:47,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:20:47,250 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:20:47,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:20:47,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:20:47,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:20:47,251 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:20:47,254 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:20:47,254 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:20:47,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:20:47,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:20:47,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:20:47,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:20:47,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:20:47,255 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:20:47,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:20:47,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:20:47,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:20:47,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:20:47,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:20:47,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:20:47,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:20:47,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:20:47,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:20:47,259 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:20:47,259 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:20:47,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:20:47,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:20:47,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:20:47,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:20:47,260 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-11-19 09:20:47,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:20:47,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:20:47,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:20:47,658 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:20:47,659 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:20:47,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2024-11-19 09:20:49,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:20:49,595 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:20:49,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-11-19 09:20:49,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f719b0171/90b56d5c9e6740eb8dbbbb854e5901a1/FLAG53f62820a [2024-11-19 09:20:49,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f719b0171/90b56d5c9e6740eb8dbbbb854e5901a1 [2024-11-19 09:20:49,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:20:49,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:20:49,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:20:49,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:20:49,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:20:49,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:20:49" (1/1) ... [2024-11-19 09:20:49,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c79de33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:49, skipping insertion in model container [2024-11-19 09:20:49,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:20:49" (1/1) ... [2024-11-19 09:20:49,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:20:50,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:20:50,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:20:50,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:20:50,207 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:20:50,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50 WrapperNode [2024-11-19 09:20:50,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:20:50,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:20:50,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:20:50,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:20:50,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,260 INFO L138 Inliner]: procedures = 169, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2024-11-19 09:20:50,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:20:50,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:20:50,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:20:50,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:20:50,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,297 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 09:20:50,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:20:50,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:20:50,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:20:50,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:20:50,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (1/1) ... [2024-11-19 09:20:50,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:20:50,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:50,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:20:50,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:20:50,423 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-19 09:20:50,423 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-19 09:20:50,423 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-19 09:20:50,424 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-19 09:20:50,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:20:50,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:20:50,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:20:50,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:20:50,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:20:50,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:20:50,427 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:20:50,589 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:20:50,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:20:50,775 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:20:50,775 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:20:50,908 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:20:50,908 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:20:50,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:20:50 BoogieIcfgContainer [2024-11-19 09:20:50,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:20:50,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:20:50,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:20:50,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:20:50,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:20:49" (1/3) ... [2024-11-19 09:20:50,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547655ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:20:50, skipping insertion in model container [2024-11-19 09:20:50,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:20:50" (2/3) ... [2024-11-19 09:20:50,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547655ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:20:50, skipping insertion in model container [2024-11-19 09:20:50,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:20:50" (3/3) ... [2024-11-19 09:20:50,920 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-11-19 09:20:50,937 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:20:50,938 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:20:50,938 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:20:50,998 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:20:51,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2024-11-19 09:20:51,061 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-19 09:20:51,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:20:51,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-11-19 09:20:51,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2024-11-19 09:20:51,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2024-11-19 09:20:51,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:20:51,084 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;@1c41a2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:20:51,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 09:20:51,102 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:20:51,103 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-11-19 09:20:51,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:20:51,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:51,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:51,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-11-19 09:20:51,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1944846646, now seen corresponding path program 1 times [2024-11-19 09:20:51,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:51,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231912077] [2024-11-19 09:20:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:51,127 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-11-19 09:20:51,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:51,128 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-11-19 09:20:51,129 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-11-19 09:20:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:51,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:20:51,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:51,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:20:51,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:20:51,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231912077] [2024-11-19 09:20:51,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231912077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:51,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:51,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:20:51,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695860508] [2024-11-19 09:20:51,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:51,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:20:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:20:51,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:20:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:20:51,308 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2024-11-19 09:20:51,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-11-19 09:20:51,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:51,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2024-11-19 09:20:51,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:51,406 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2024-11-19 09:20:51,407 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:20:51,408 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-11-19 09:20:51,414 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2024-11-19 09:20:51,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2024-11-19 09:20:51,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:20:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:20:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-11-19 09:20:51,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-11-19 09:20:51,428 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2024-11-19 09:20:51,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2024-11-19 09:20:51,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:20:51,434 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2024-11-19 09:20:51,436 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-11-19 09:20:51,442 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2024-11-19 09:20:51,443 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2024-11-19 09:20:51,443 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-11-19 09:20:51,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:51,443 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:51,447 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 (2)] Ended with exit code 0 [2024-11-19 09:20:51,646 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-11-19 09:20:51,646 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-11-19 09:20:51,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1944845514, now seen corresponding path program 1 times [2024-11-19 09:20:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:51,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111825535] [2024-11-19 09:20:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:51,648 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-11-19 09:20:51,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:51,651 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-11-19 09:20:51,652 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-11-19 09:20:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:51,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:20:51,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:51,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:20:51,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:20:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111825535] [2024-11-19 09:20:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111825535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:51,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:51,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:20:51,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943115895] [2024-11-19 09:20:51,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:51,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:20:51,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:20:51,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:20:51,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:20:51,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:51,860 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-11-19 09:20:51,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:51,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:51,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:52,138 INFO L124 PetriNetUnfolderBase]: 328/593 cut-off events. [2024-11-19 09:20:52,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:20:52,141 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-11-19 09:20:52,144 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 29 selfloop transitions, 7 changer transitions 29/69 dead transitions. [2024-11-19 09:20:52,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 69 transitions, 274 flow [2024-11-19 09:20:52,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:20:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:20:52,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-11-19 09:20:52,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2024-11-19 09:20:52,147 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 8 states and 131 transitions. [2024-11-19 09:20:52,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 69 transitions, 274 flow [2024-11-19 09:20:52,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 69 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:20:52,151 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 100 flow [2024-11-19 09:20:52,151 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-11-19 09:20:52,152 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-11-19 09:20:52,152 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 100 flow [2024-11-19 09:20:52,152 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-11-19 09:20:52,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:52,153 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:52,157 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-11-19 09:20:52,353 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-11-19 09:20:52,354 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-11-19 09:20:52,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash 407958523, now seen corresponding path program 1 times [2024-11-19 09:20:52,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:52,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935711539] [2024-11-19 09:20:52,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:52,355 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-11-19 09:20:52,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:52,359 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-11-19 09:20:52,360 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-11-19 09:20:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:52,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:20:52,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:52,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:20:52,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:20:52,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935711539] [2024-11-19 09:20:52,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935711539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:52,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:52,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:20:52,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638357362] [2024-11-19 09:20:52,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:52,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:20:52,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:20:52,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:20:52,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:20:52,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:52,534 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-11-19 09:20:52,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:52,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:52,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:52,782 INFO L124 PetriNetUnfolderBase]: 247/454 cut-off events. [2024-11-19 09:20:52,782 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2024-11-19 09:20:52,785 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-11-19 09:20:52,790 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 9 changer transitions 16/59 dead transitions. [2024-11-19 09:20:52,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 316 flow [2024-11-19 09:20:52,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:20:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:20:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-11-19 09:20:52,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.541871921182266 [2024-11-19 09:20:52,795 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 100 flow. Second operand 7 states and 110 transitions. [2024-11-19 09:20:52,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 316 flow [2024-11-19 09:20:52,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-19 09:20:52,803 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 143 flow [2024-11-19 09:20:52,804 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-11-19 09:20:52,805 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-11-19 09:20:52,805 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 143 flow [2024-11-19 09:20:52,805 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-11-19 09:20:52,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:52,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:52,817 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 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:20:53,008 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-11-19 09:20:53,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 09:20:53,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1492998092, now seen corresponding path program 1 times [2024-11-19 09:20:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:53,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383824261] [2024-11-19 09:20:53,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:53,011 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-11-19 09:20:53,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:53,013 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-11-19 09:20:53,013 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-11-19 09:20:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:53,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:20:53,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:53,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:20:53,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:20:53,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383824261] [2024-11-19 09:20:53,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383824261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:53,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:20:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805182733] [2024-11-19 09:20:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:53,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:20:53,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:20:53,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:20:53,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:20:53,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:53,139 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-11-19 09:20:53,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:53,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:53,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:53,398 INFO L124 PetriNetUnfolderBase]: 391/725 cut-off events. [2024-11-19 09:20:53,398 INFO L125 PetriNetUnfolderBase]: For 1146/1146 co-relation queries the response was YES. [2024-11-19 09:20:53,401 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-11-19 09:20:53,404 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 11 changer transitions 20/82 dead transitions. [2024-11-19 09:20:53,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 82 transitions, 517 flow [2024-11-19 09:20:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:20:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:20:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-11-19 09:20:53,406 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-11-19 09:20:53,406 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 143 flow. Second operand 9 states and 144 transitions. [2024-11-19 09:20:53,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 82 transitions, 517 flow [2024-11-19 09:20:53,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 478 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-11-19 09:20:53,414 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 236 flow [2024-11-19 09:20:53,414 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-11-19 09:20:53,415 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-11-19 09:20:53,415 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 236 flow [2024-11-19 09:20:53,415 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-11-19 09:20:53,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:53,415 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:53,420 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 (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:20:53,616 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-11-19 09:20:53,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-19 09:20:53,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:53,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1610009804, now seen corresponding path program 2 times [2024-11-19 09:20:53,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:53,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101355448] [2024-11-19 09:20:53,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:20:53,619 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-11-19 09:20:53,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:53,622 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-11-19 09:20:53,623 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-11-19 09:20:53,667 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:20:53,668 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:53,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:20:53,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:53,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:20:53,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:20:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101355448] [2024-11-19 09:20:53,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101355448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:53,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:53,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:20:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048523968] [2024-11-19 09:20:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:53,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:20:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:20:53,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:20:53,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:20:53,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:53,768 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-11-19 09:20:53,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:53,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:53,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:54,014 INFO L124 PetriNetUnfolderBase]: 346/655 cut-off events. [2024-11-19 09:20:54,015 INFO L125 PetriNetUnfolderBase]: For 2058/2058 co-relation queries the response was YES. [2024-11-19 09:20:54,018 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-11-19 09:20:54,020 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 12 changer transitions 30/86 dead transitions. [2024-11-19 09:20:54,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 655 flow [2024-11-19 09:20:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:20:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:20:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-11-19 09:20:54,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2024-11-19 09:20:54,022 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 236 flow. Second operand 9 states and 140 transitions. [2024-11-19 09:20:54,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 655 flow [2024-11-19 09:20:54,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 595 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-11-19 09:20:54,031 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 278 flow [2024-11-19 09:20:54,031 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-11-19 09:20:54,032 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-11-19 09:20:54,032 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 278 flow [2024-11-19 09:20:54,032 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-11-19 09:20:54,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:54,032 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:54,039 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-11-19 09:20:54,236 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-11-19 09:20:54,236 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-11-19 09:20:54,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:54,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1235422649, now seen corresponding path program 1 times [2024-11-19 09:20:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:54,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659715768] [2024-11-19 09:20:54,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:54,238 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-11-19 09:20:54,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:54,242 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-11-19 09:20:54,246 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-11-19 09:20:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:54,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:20:54,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:54,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:20:54,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:20:54,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659715768] [2024-11-19 09:20:54,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659715768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:54,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:54,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:20:54,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980164058] [2024-11-19 09:20:54,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:54,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:20:54,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:20:54,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:20:54,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:20:54,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:54,389 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-11-19 09:20:54,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:54,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:54,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:54,678 INFO L124 PetriNetUnfolderBase]: 427/806 cut-off events. [2024-11-19 09:20:54,678 INFO L125 PetriNetUnfolderBase]: For 3492/3492 co-relation queries the response was YES. [2024-11-19 09:20:54,681 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-11-19 09:20:54,684 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 51 selfloop transitions, 12 changer transitions 26/93 dead transitions. [2024-11-19 09:20:54,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 752 flow [2024-11-19 09:20:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:20:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:20:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-11-19 09:20:54,687 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2024-11-19 09:20:54,687 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 278 flow. Second operand 10 states and 158 transitions. [2024-11-19 09:20:54,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 752 flow [2024-11-19 09:20:54,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 718 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-11-19 09:20:54,719 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 345 flow [2024-11-19 09:20:54,719 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-11-19 09:20:54,723 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-11-19 09:20:54,723 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 345 flow [2024-11-19 09:20:54,724 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-11-19 09:20:54,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:54,727 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:54,735 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 (7)] Ended with exit code 0 [2024-11-19 09:20:54,927 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-11-19 09:20:54,928 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-11-19 09:20:54,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash -14089357, now seen corresponding path program 2 times [2024-11-19 09:20:54,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:54,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290290939] [2024-11-19 09:20:54,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:20:54,929 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-11-19 09:20:54,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:54,933 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-11-19 09:20:54,934 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-11-19 09:20:54,976 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:20:54,976 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:54,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:20:54,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:55,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:20:55,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:20:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290290939] [2024-11-19 09:20:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290290939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:55,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:20:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323867762] [2024-11-19 09:20:55,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:55,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:20:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:20:55,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:20:55,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:20:55,073 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:55,074 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-11-19 09:20:55,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:55,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:55,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:55,418 INFO L124 PetriNetUnfolderBase]: 463/891 cut-off events. [2024-11-19 09:20:55,418 INFO L125 PetriNetUnfolderBase]: For 6473/6473 co-relation queries the response was YES. [2024-11-19 09:20:55,421 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-11-19 09:20:55,425 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 56 selfloop transitions, 17 changer transitions 30/107 dead transitions. [2024-11-19 09:20:55,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 978 flow [2024-11-19 09:20:55,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:20:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:20:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-11-19 09:20:55,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-11-19 09:20:55,428 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 345 flow. Second operand 12 states and 186 transitions. [2024-11-19 09:20:55,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 978 flow [2024-11-19 09:20:55,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 842 flow, removed 59 selfloop flow, removed 7 redundant places. [2024-11-19 09:20:55,441 INFO L231 Difference]: Finished difference. Result has 75 places, 48 transitions, 395 flow [2024-11-19 09:20:55,442 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-11-19 09:20:55,443 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2024-11-19 09:20:55,443 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 48 transitions, 395 flow [2024-11-19 09:20:55,443 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-11-19 09:20:55,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:55,443 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:55,450 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-11-19 09:20:55,649 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-11-19 09:20:55,649 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-11-19 09:20:55,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash 476818575, now seen corresponding path program 3 times [2024-11-19 09:20:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:55,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824176251] [2024-11-19 09:20:55,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:20:55,650 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-11-19 09:20:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:55,653 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-11-19 09:20:55,657 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-11-19 09:20:55,699 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:20:55,699 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:55,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:20:55,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:55,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:20:55,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:20:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824176251] [2024-11-19 09:20:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824176251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:55,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:20:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823681502] [2024-11-19 09:20:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:55,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:20:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:20:55,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:20:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:20:55,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:55,830 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-11-19 09:20:55,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:55,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:55,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:56,136 INFO L124 PetriNetUnfolderBase]: 436/839 cut-off events. [2024-11-19 09:20:56,137 INFO L125 PetriNetUnfolderBase]: For 6137/6137 co-relation queries the response was YES. [2024-11-19 09:20:56,139 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-11-19 09:20:56,143 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 9 changer transitions 29/96 dead transitions. [2024-11-19 09:20:56,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 875 flow [2024-11-19 09:20:56,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:20:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:20:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2024-11-19 09:20:56,144 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2024-11-19 09:20:56,144 INFO L175 Difference]: Start difference. First operand has 75 places, 48 transitions, 395 flow. Second operand 10 states and 153 transitions. [2024-11-19 09:20:56,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 875 flow [2024-11-19 09:20:56,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 804 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-11-19 09:20:56,157 INFO L231 Difference]: Finished difference. Result has 79 places, 50 transitions, 405 flow [2024-11-19 09:20:56,157 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-11-19 09:20:56,158 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-11-19 09:20:56,158 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 50 transitions, 405 flow [2024-11-19 09:20:56,158 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-11-19 09:20:56,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:56,159 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:56,163 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-11-19 09:20:56,361 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-11-19 09:20:56,362 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-11-19 09:20:56,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1841714377, now seen corresponding path program 4 times [2024-11-19 09:20:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:56,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514786656] [2024-11-19 09:20:56,363 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:20:56,363 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-11-19 09:20:56,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:56,367 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-11-19 09:20:56,367 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-11-19 09:20:56,414 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:20:56,414 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:56,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:20:56,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:56,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:20:56,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:20:56,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514786656] [2024-11-19 09:20:56,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514786656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:56,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:56,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:20:56,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162071225] [2024-11-19 09:20:56,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:56,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:20:56,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:20:56,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:20:56,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:20:56,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:56,506 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-11-19 09:20:56,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:56,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:56,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:56,791 INFO L124 PetriNetUnfolderBase]: 463/887 cut-off events. [2024-11-19 09:20:56,792 INFO L125 PetriNetUnfolderBase]: For 6613/6613 co-relation queries the response was YES. [2024-11-19 09:20:56,794 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-11-19 09:20:56,798 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 16 changer transitions 21/95 dead transitions. [2024-11-19 09:20:56,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 95 transitions, 883 flow [2024-11-19 09:20:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:20:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:20:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-11-19 09:20:56,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2024-11-19 09:20:56,800 INFO L175 Difference]: Start difference. First operand has 79 places, 50 transitions, 405 flow. Second operand 9 states and 140 transitions. [2024-11-19 09:20:56,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 95 transitions, 883 flow [2024-11-19 09:20:56,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 827 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-11-19 09:20:56,816 INFO L231 Difference]: Finished difference. Result has 81 places, 53 transitions, 468 flow [2024-11-19 09:20:56,816 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-11-19 09:20:56,817 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2024-11-19 09:20:56,817 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 53 transitions, 468 flow [2024-11-19 09:20:56,818 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-11-19 09:20:56,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:56,818 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:56,823 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 09:20:57,018 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-11-19 09:20:57,019 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-11-19 09:20:57,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1638196562, now seen corresponding path program 1 times [2024-11-19 09:20:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119113427] [2024-11-19 09:20:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:57,020 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-11-19 09:20:57,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:57,021 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-11-19 09:20:57,022 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-11-19 09:20:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:57,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:20:57,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:57,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:57,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:20:57,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119113427] [2024-11-19 09:20:57,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119113427] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:57,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:20:57,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 09:20:57,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658297282] [2024-11-19 09:20:57,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:57,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:20:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:20:57,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:20:57,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:20:57,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:57,402 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-11-19 09:20:57,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:57,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:57,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:58,313 INFO L124 PetriNetUnfolderBase]: 697/1284 cut-off events. [2024-11-19 09:20:58,313 INFO L125 PetriNetUnfolderBase]: For 14498/14498 co-relation queries the response was YES. [2024-11-19 09:20:58,317 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-11-19 09:20:58,322 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 69 selfloop transitions, 43 changer transitions 60/176 dead transitions. [2024-11-19 09:20:58,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 176 transitions, 1752 flow [2024-11-19 09:20:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 09:20:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-19 09:20:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 323 transitions. [2024-11-19 09:20:58,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5303776683087028 [2024-11-19 09:20:58,324 INFO L175 Difference]: Start difference. First operand has 81 places, 53 transitions, 468 flow. Second operand 21 states and 323 transitions. [2024-11-19 09:20:58,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 176 transitions, 1752 flow [2024-11-19 09:20:58,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 176 transitions, 1659 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-11-19 09:20:58,348 INFO L231 Difference]: Finished difference. Result has 103 places, 69 transitions, 885 flow [2024-11-19 09:20:58,350 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-11-19 09:20:58,351 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-11-19 09:20:58,351 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 69 transitions, 885 flow [2024-11-19 09:20:58,351 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-11-19 09:20:58,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:58,351 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:58,357 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 (11)] Ended with exit code 0 [2024-11-19 09:20:58,552 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-11-19 09:20:58,552 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-11-19 09:20:58,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash -389170009, now seen corresponding path program 1 times [2024-11-19 09:20:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:58,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586314216] [2024-11-19 09:20:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:58,553 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-11-19 09:20:58,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:58,555 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-11-19 09:20:58,557 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-11-19 09:20:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:58,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:20:58,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:58,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:58,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:20:58,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586314216] [2024-11-19 09:20:58,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586314216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:58,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:20:58,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 09:20:58,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144213054] [2024-11-19 09:20:58,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:58,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:20:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:20:58,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:20:58,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:20:58,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:20:58,893 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-11-19 09:20:58,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:58,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:20:58,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:59,623 INFO L124 PetriNetUnfolderBase]: 787/1487 cut-off events. [2024-11-19 09:20:59,623 INFO L125 PetriNetUnfolderBase]: For 27581/27581 co-relation queries the response was YES. [2024-11-19 09:20:59,627 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-11-19 09:20:59,633 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 85 selfloop transitions, 19 changer transitions 67/175 dead transitions. [2024-11-19 09:20:59,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 175 transitions, 2251 flow [2024-11-19 09:20:59,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:20:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-19 09:20:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2024-11-19 09:20:59,635 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5226860254083484 [2024-11-19 09:20:59,636 INFO L175 Difference]: Start difference. First operand has 103 places, 69 transitions, 885 flow. Second operand 19 states and 288 transitions. [2024-11-19 09:20:59,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 175 transitions, 2251 flow [2024-11-19 09:20:59,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 175 transitions, 1697 flow, removed 258 selfloop flow, removed 14 redundant places. [2024-11-19 09:20:59,677 INFO L231 Difference]: Finished difference. Result has 115 places, 75 transitions, 766 flow [2024-11-19 09:20:59,678 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-11-19 09:20:59,679 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2024-11-19 09:20:59,680 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 75 transitions, 766 flow [2024-11-19 09:20:59,680 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-11-19 09:20:59,680 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:59,680 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:59,685 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 (12)] Forceful destruction successful, exit code 0 [2024-11-19 09:20:59,881 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-11-19 09:20:59,881 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-11-19 09:20:59,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:59,881 INFO L85 PathProgramCache]: Analyzing trace with hash -295210743, now seen corresponding path program 2 times [2024-11-19 09:20:59,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:20:59,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328725917] [2024-11-19 09:20:59,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:20:59,882 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-11-19 09:20:59,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:20:59,883 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-11-19 09:20:59,884 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-11-19 09:20:59,927 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:20:59,927 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:20:59,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:20:59,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:21:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:00,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:21:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:00,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:21:00,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328725917] [2024-11-19 09:21:00,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328725917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:21:00,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:21:00,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 09:21:00,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087678202] [2024-11-19 09:21:00,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:21:00,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:21:00,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:21:00,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:21:00,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:21:00,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:21:00,250 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-11-19 09:21:00,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:00,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:21:00,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:01,466 INFO L124 PetriNetUnfolderBase]: 1246/2341 cut-off events. [2024-11-19 09:21:01,467 INFO L125 PetriNetUnfolderBase]: For 56993/56993 co-relation queries the response was YES. [2024-11-19 09:21:01,476 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-11-19 09:21:01,488 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 129 selfloop transitions, 54 changer transitions 59/246 dead transitions. [2024-11-19 09:21:01,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 246 transitions, 3242 flow [2024-11-19 09:21:01,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 09:21:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-19 09:21:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 421 transitions. [2024-11-19 09:21:01,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5376756066411239 [2024-11-19 09:21:01,491 INFO L175 Difference]: Start difference. First operand has 115 places, 75 transitions, 766 flow. Second operand 27 states and 421 transitions. [2024-11-19 09:21:01,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 246 transitions, 3242 flow [2024-11-19 09:21:01,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 246 transitions, 2735 flow, removed 241 selfloop flow, removed 12 redundant places. [2024-11-19 09:21:01,536 INFO L231 Difference]: Finished difference. Result has 139 places, 97 transitions, 1308 flow [2024-11-19 09:21:01,537 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-11-19 09:21:01,537 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-11-19 09:21:01,538 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 97 transitions, 1308 flow [2024-11-19 09:21:01,538 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-11-19 09:21:01,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:01,538 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:01,548 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-11-19 09:21:01,741 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-11-19 09:21:01,742 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-11-19 09:21:01,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1659104887, now seen corresponding path program 3 times [2024-11-19 09:21:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:21:01,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641561151] [2024-11-19 09:21:01,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:21:01,744 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-11-19 09:21:01,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:21:01,747 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-11-19 09:21:01,780 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-11-19 09:21:01,825 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 09:21:01,825 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:21:01,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:21:01,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:21:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:01,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:21:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:21:02,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:21:02,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641561151] [2024-11-19 09:21:02,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641561151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:21:02,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:21:02,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 09:21:02,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735178445] [2024-11-19 09:21:02,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:21:02,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:21:02,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:21:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:21:02,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:21:02,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:21:02,112 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-11-19 09:21:02,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:02,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:21:02,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:03,148 INFO L124 PetriNetUnfolderBase]: 1318/2463 cut-off events. [2024-11-19 09:21:03,148 INFO L125 PetriNetUnfolderBase]: For 90317/90317 co-relation queries the response was YES. [2024-11-19 09:21:03,158 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-11-19 09:21:03,168 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 99 selfloop transitions, 68 changer transitions 95/266 dead transitions. [2024-11-19 09:21:03,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 266 transitions, 4146 flow [2024-11-19 09:21:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 09:21:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-19 09:21:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 383 transitions. [2024-11-19 09:21:03,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5282758620689655 [2024-11-19 09:21:03,170 INFO L175 Difference]: Start difference. First operand has 139 places, 97 transitions, 1308 flow. Second operand 25 states and 383 transitions. [2024-11-19 09:21:03,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 266 transitions, 4146 flow [2024-11-19 09:21:03,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 266 transitions, 3311 flow, removed 402 selfloop flow, removed 14 redundant places. [2024-11-19 09:21:03,275 INFO L231 Difference]: Finished difference. Result has 158 places, 115 transitions, 1613 flow [2024-11-19 09:21:03,277 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-11-19 09:21:03,277 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 128 predicate places. [2024-11-19 09:21:03,277 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 115 transitions, 1613 flow [2024-11-19 09:21:03,277 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-11-19 09:21:03,278 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:03,278 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:03,282 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-11-19 09:21:03,478 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-11-19 09:21:03,479 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-11-19 09:21:03,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash -627287686, now seen corresponding path program 1 times [2024-11-19 09:21:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:21:03,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402394988] [2024-11-19 09:21:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:21:03,480 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-11-19 09:21:03,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:21:03,481 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-11-19 09:21:03,482 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-11-19 09:21:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:21:03,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:21:03,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:21:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:21:03,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:21:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:21:03,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:21:03,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402394988] [2024-11-19 09:21:03,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402394988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:21:03,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:21:03,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-19 09:21:03,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137166687] [2024-11-19 09:21:03,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:21:03,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 09:21:03,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:21:03,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 09:21:03,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-19 09:21:04,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:21:04,023 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-11-19 09:21:04,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:21:04,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:21:04,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:21:05,916 INFO L124 PetriNetUnfolderBase]: 1687/3115 cut-off events. [2024-11-19 09:21:05,917 INFO L125 PetriNetUnfolderBase]: For 123387/123387 co-relation queries the response was YES. [2024-11-19 09:21:05,932 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-11-19 09:21:05,952 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 125 selfloop transitions, 111 changer transitions 105/345 dead transitions. [2024-11-19 09:21:05,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 345 transitions, 5341 flow [2024-11-19 09:21:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-19 09:21:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-19 09:21:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 551 transitions. [2024-11-19 09:21:05,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-11-19 09:21:05,956 INFO L175 Difference]: Start difference. First operand has 158 places, 115 transitions, 1613 flow. Second operand 36 states and 551 transitions. [2024-11-19 09:21:05,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 345 transitions, 5341 flow [2024-11-19 09:21:06,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 345 transitions, 4700 flow, removed 296 selfloop flow, removed 19 redundant places. [2024-11-19 09:21:06,159 INFO L231 Difference]: Finished difference. Result has 186 places, 154 transitions, 2535 flow [2024-11-19 09:21:06,160 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-11-19 09:21:06,161 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2024-11-19 09:21:06,162 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 154 transitions, 2535 flow [2024-11-19 09:21:06,162 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-11-19 09:21:06,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:21:06,162 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:21:06,167 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-11-19 09:21:06,363 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-11-19 09:21:06,364 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-11-19 09:21:06,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:21:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash 291804209, now seen corresponding path program 2 times [2024-11-19 09:21:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:21:06,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158086167] [2024-11-19 09:21:06,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:21:06,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-11-19 09:21:06,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:21:06,368 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-11-19 09:21:06,371 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-11-19 09:21:06,428 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:21:06,429 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:21:06,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:21:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:21:06,531 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:21:06,532 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:21:06,533 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-19 09:21:06,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-19 09:21:06,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-19 09:21:06,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-19 09:21:06,542 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-11-19 09:21:06,736 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-11-19 09:21:06,737 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1] [2024-11-19 09:21:06,839 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:21:06,839 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:21:06,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:21:06 BasicIcfg [2024-11-19 09:21:06,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:21:06,845 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:21:06,845 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:21:06,845 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:21:06,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:20:50" (3/4) ... [2024-11-19 09:21:06,848 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:21:06,850 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:21:06,850 INFO L158 Benchmark]: Toolchain (without parser) took 17211.60ms. Allocated memory was 56.6MB in the beginning and 335.5MB in the end (delta: 278.9MB). Free memory was 37.7MB in the beginning and 195.2MB in the end (delta: -157.5MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,850 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 41.9MB. Free memory is still 18.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:21:06,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.66ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 37.5MB in the beginning and 40.7MB in the end (delta: -3.2MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.12ms. Allocated memory is still 69.2MB. Free memory was 40.7MB in the beginning and 38.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,851 INFO L158 Benchmark]: Boogie Preprocessor took 67.09ms. Allocated memory is still 69.2MB. Free memory was 38.6MB in the beginning and 36.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,851 INFO L158 Benchmark]: RCFGBuilder took 580.53ms. Allocated memory is still 69.2MB. Free memory was 36.2MB in the beginning and 31.9MB in the end (delta: 4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,852 INFO L158 Benchmark]: TraceAbstraction took 15932.37ms. Allocated memory was 69.2MB in the beginning and 335.5MB in the end (delta: 266.3MB). Free memory was 31.3MB in the beginning and 195.2MB in the end (delta: -164.0MB). Peak memory consumption was 218.4MB. Max. memory is 16.1GB. [2024-11-19 09:21:06,852 INFO L158 Benchmark]: Witness Printer took 5.10ms. Allocated memory is still 335.5MB. Free memory is still 195.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:21:06,853 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 41.9MB. Free memory is still 18.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.66ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 37.5MB in the beginning and 40.7MB in the end (delta: -3.2MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.12ms. Allocated memory is still 69.2MB. Free memory was 40.7MB in the beginning and 38.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.09ms. Allocated memory is still 69.2MB. Free memory was 38.6MB in the beginning and 36.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 580.53ms. Allocated memory is still 69.2MB. Free memory was 36.2MB in the beginning and 31.9MB in the end (delta: 4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15932.37ms. Allocated memory was 69.2MB in the beginning and 335.5MB in the end (delta: 266.3MB). Free memory was 31.3MB in the beginning and 195.2MB in the end (delta: -164.0MB). Peak memory consumption was 218.4MB. Max. memory is 16.1GB. * Witness Printer took 5.10ms. Allocated memory is still 335.5MB. Free memory is still 195.2MB. 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)=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: 15.7s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1701 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1681 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 3.2s 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.2s 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-11-19 09:21:06,883 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