./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 3289d67d 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.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:06:11,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:06:11,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:06:11,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:06:11,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:06:11,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:06:11,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:06:11,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:06:11,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:06:11,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:06:11,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:06:11,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:06:11,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:06:11,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:06:11,999 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:06:11,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:06:11,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:06:12,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:06:12,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:06:12,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:06:12,001 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:06:12,002 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:06:12,002 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:06:12,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:06:12,003 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:06:12,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:06:12,003 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:06:12,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:06:12,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:06:12,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:06:12,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:06:12,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:06:12,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:06:12,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:06:12,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:06:12,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:06:12,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:06:12,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:06:12,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:06:12,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:06:12,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:06:12,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:06:12,007 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-17 03:06:12,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:06:12,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:06:12,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:06:12,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:06:12,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:06:12,224 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-17 03:06:13,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:06:13,642 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:06:13,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-11-17 03:06:13,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e94f0ce/4207d3ec9ca34ea8aa191573ce40cbdc/FLAGa56a46890 [2024-11-17 03:06:13,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e94f0ce/4207d3ec9ca34ea8aa191573ce40cbdc [2024-11-17 03:06:13,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:06:13,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:06:13,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:06:13,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:06:13,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:06:13,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:06:13" (1/1) ... [2024-11-17 03:06:13,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a9198a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:13, skipping insertion in model container [2024-11-17 03:06:13,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:06:13" (1/1) ... [2024-11-17 03:06:13,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:06:14,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:06:14,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:06:14,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:06:14,088 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:06:14,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14 WrapperNode [2024-11-17 03:06:14,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:06:14,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:06:14,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:06:14,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:06:14,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,137 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-11-17 03:06:14,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:06:14,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:06:14,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:06:14,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:06:14,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,164 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-17 03:06:14,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:06:14,171 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:06:14,171 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:06:14,172 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:06:14,172 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (1/1) ... [2024-11-17 03:06:14,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:06:14,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:14,200 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-17 03:06:14,202 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-17 03:06:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-17 03:06:14,239 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-17 03:06:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-17 03:06:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-17 03:06:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:06:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:06:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:06:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:06:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:06:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:06:14,241 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:06:14,324 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:06:14,326 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:06:14,432 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:06:14,433 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:06:14,517 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:06:14,519 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:06:14,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:06:14 BoogieIcfgContainer [2024-11-17 03:06:14,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:06:14,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:06:14,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:06:14,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:06:14,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:06:13" (1/3) ... [2024-11-17 03:06:14,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f5f13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:06:14, skipping insertion in model container [2024-11-17 03:06:14,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:14" (2/3) ... [2024-11-17 03:06:14,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f5f13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:06:14, skipping insertion in model container [2024-11-17 03:06:14,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:06:14" (3/3) ... [2024-11-17 03:06:14,528 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-11-17 03:06:14,540 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:06:14,540 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 03:06:14,540 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:06:14,581 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:06:14,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 78 flow [2024-11-17 03:06:14,629 INFO L124 PetriNetUnfolderBase]: 6/33 cut-off events. [2024-11-17 03:06:14,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:06:14,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 6/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-11-17 03:06:14,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 35 transitions, 78 flow [2024-11-17 03:06:14,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 33 transitions, 72 flow [2024-11-17 03:06:14,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:06:14,653 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;@5cfa50ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:06:14,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-17 03:06:14,666 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:06:14,666 INFO L124 PetriNetUnfolderBase]: 6/30 cut-off events. [2024-11-17 03:06:14,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:06:14,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:14,667 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:14,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:14,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1743452533, now seen corresponding path program 1 times [2024-11-17 03:06:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:14,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130703290] [2024-11-17 03:06:14,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:14,867 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-17 03:06:14,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:14,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130703290] [2024-11-17 03:06:14,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130703290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:14,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:14,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:06:14,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860388313] [2024-11-17 03:06:14,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:14,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:06:14,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:14,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:06:14,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:06:14,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:14,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 72 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-17 03:06:14,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:14,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:14,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:15,045 INFO L124 PetriNetUnfolderBase]: 217/401 cut-off events. [2024-11-17 03:06:15,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:06:15,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 401 events. 217/401 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1969 event pairs, 159 based on Foata normal form. 90/466 useless extension candidates. Maximal degree in co-relation 743. Up to 338 conditions per place. [2024-11-17 03:06:15,049 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 15 selfloop transitions, 1 changer transitions 2/27 dead transitions. [2024-11-17 03:06:15,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 96 flow [2024-11-17 03:06:15,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:06:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:06:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-11-17 03:06:15,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-17 03:06:15,061 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 72 flow. Second operand 3 states and 56 transitions. [2024-11-17 03:06:15,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 96 flow [2024-11-17 03:06:15,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:06:15,065 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 56 flow [2024-11-17 03:06:15,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2024-11-17 03:06:15,069 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2024-11-17 03:06:15,069 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 56 flow [2024-11-17 03:06:15,070 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-17 03:06:15,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:15,071 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:15,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:06:15,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:15,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1743452893, now seen corresponding path program 1 times [2024-11-17 03:06:15,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:15,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373548690] [2024-11-17 03:06:15,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:15,247 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-17 03:06:15,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:15,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373548690] [2024-11-17 03:06:15,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373548690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:15,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:15,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:06:15,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140354728] [2024-11-17 03:06:15,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:15,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:06:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:15,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:06:15,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:06:15,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:15,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-17 03:06:15,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:15,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:15,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:15,414 INFO L124 PetriNetUnfolderBase]: 273/525 cut-off events. [2024-11-17 03:06:15,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:06:15,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 525 events. 273/525 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2612 event pairs, 45 based on Foata normal form. 0/468 useless extension candidates. Maximal degree in co-relation 959. Up to 181 conditions per place. [2024-11-17 03:06:15,420 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 25 selfloop transitions, 4 changer transitions 20/57 dead transitions. [2024-11-17 03:06:15,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 218 flow [2024-11-17 03:06:15,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:06:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:06:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-11-17 03:06:15,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-11-17 03:06:15,424 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 6 states and 117 transitions. [2024-11-17 03:06:15,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 218 flow [2024-11-17 03:06:15,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 57 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:06:15,426 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 82 flow [2024-11-17 03:06:15,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2024-11-17 03:06:15,426 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2024-11-17 03:06:15,427 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 82 flow [2024-11-17 03:06:15,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-17 03:06:15,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:15,427 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:15,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:06:15,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:15,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1838742358, now seen corresponding path program 1 times [2024-11-17 03:06:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:15,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242305382] [2024-11-17 03:06:15,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:15,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:15,545 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-17 03:06:15,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:15,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242305382] [2024-11-17 03:06:15,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242305382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:15,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:15,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:06:15,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717262969] [2024-11-17 03:06:15,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:15,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:06:15,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:15,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:06:15,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:06:15,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:15,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-17 03:06:15,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:15,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:15,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:15,719 INFO L124 PetriNetUnfolderBase]: 382/800 cut-off events. [2024-11-17 03:06:15,719 INFO L125 PetriNetUnfolderBase]: For 273/282 co-relation queries the response was YES. [2024-11-17 03:06:15,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1698 conditions, 800 events. 382/800 cut-off events. For 273/282 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4461 event pairs, 65 based on Foata normal form. 33/763 useless extension candidates. Maximal degree in co-relation 1687. Up to 246 conditions per place. [2024-11-17 03:06:15,724 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 46 selfloop transitions, 9 changer transitions 20/83 dead transitions. [2024-11-17 03:06:15,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 83 transitions, 390 flow [2024-11-17 03:06:15,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:06:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:06:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-11-17 03:06:15,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-17 03:06:15,726 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 82 flow. Second operand 9 states and 171 transitions. [2024-11-17 03:06:15,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 83 transitions, 390 flow [2024-11-17 03:06:15,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 83 transitions, 374 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-17 03:06:15,730 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 167 flow [2024-11-17 03:06:15,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=167, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2024-11-17 03:06:15,731 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2024-11-17 03:06:15,731 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 167 flow [2024-11-17 03:06:15,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-17 03:06:15,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:15,732 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:15,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:06:15,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:15,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash 142093728, now seen corresponding path program 2 times [2024-11-17 03:06:15,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:15,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279770236] [2024-11-17 03:06:15,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:15,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:15,853 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-17 03:06:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279770236] [2024-11-17 03:06:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279770236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:15,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:15,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:06:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074420249] [2024-11-17 03:06:15,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:15,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:06:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:15,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:06:15,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:06:15,860 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:15,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-17 03:06:15,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:15,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:15,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:16,045 INFO L124 PetriNetUnfolderBase]: 328/701 cut-off events. [2024-11-17 03:06:16,046 INFO L125 PetriNetUnfolderBase]: For 997/1021 co-relation queries the response was YES. [2024-11-17 03:06:16,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 701 events. 328/701 cut-off events. For 997/1021 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3911 event pairs, 65 based on Foata normal form. 63/697 useless extension candidates. Maximal degree in co-relation 1813. Up to 234 conditions per place. [2024-11-17 03:06:16,049 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 38 selfloop transitions, 9 changer transitions 28/83 dead transitions. [2024-11-17 03:06:16,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 83 transitions, 507 flow [2024-11-17 03:06:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:06:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:06:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-11-17 03:06:16,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5392857142857143 [2024-11-17 03:06:16,050 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 167 flow. Second operand 8 states and 151 transitions. [2024-11-17 03:06:16,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 83 transitions, 507 flow [2024-11-17 03:06:16,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 83 transitions, 499 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-17 03:06:16,054 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 221 flow [2024-11-17 03:06:16,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2024-11-17 03:06:16,055 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2024-11-17 03:06:16,055 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 221 flow [2024-11-17 03:06:16,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-17 03:06:16,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:16,056 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:16,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:06:16,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:16,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1794957727, now seen corresponding path program 1 times [2024-11-17 03:06:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:16,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77851734] [2024-11-17 03:06:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:16,166 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-17 03:06:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77851734] [2024-11-17 03:06:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77851734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:16,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:16,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:06:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614450353] [2024-11-17 03:06:16,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:16,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:06:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:16,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:06:16,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:06:16,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:16,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:16,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:16,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:16,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:16,314 INFO L124 PetriNetUnfolderBase]: 355/767 cut-off events. [2024-11-17 03:06:16,315 INFO L125 PetriNetUnfolderBase]: For 1771/1795 co-relation queries the response was YES. [2024-11-17 03:06:16,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2174 conditions, 767 events. 355/767 cut-off events. For 1771/1795 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4365 event pairs, 86 based on Foata normal form. 27/715 useless extension candidates. Maximal degree in co-relation 2151. Up to 258 conditions per place. [2024-11-17 03:06:16,319 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 43 selfloop transitions, 16 changer transitions 21/88 dead transitions. [2024-11-17 03:06:16,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 608 flow [2024-11-17 03:06:16,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:06:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:06:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-11-17 03:06:16,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5301587301587302 [2024-11-17 03:06:16,320 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 221 flow. Second operand 9 states and 167 transitions. [2024-11-17 03:06:16,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 608 flow [2024-11-17 03:06:16,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 88 transitions, 538 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-11-17 03:06:16,327 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 308 flow [2024-11-17 03:06:16,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=308, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-17 03:06:16,328 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2024-11-17 03:06:16,328 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 308 flow [2024-11-17 03:06:16,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:16,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:16,329 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:16,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:06:16,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:16,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1216712241, now seen corresponding path program 2 times [2024-11-17 03:06:16,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:16,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677623913] [2024-11-17 03:06:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:16,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:16,401 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-17 03:06:16,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:16,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677623913] [2024-11-17 03:06:16,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677623913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:16,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:16,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:06:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515084616] [2024-11-17 03:06:16,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:16,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:06:16,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:16,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:06:16,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:06:16,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:16,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:16,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:16,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:16,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:16,579 INFO L124 PetriNetUnfolderBase]: 427/920 cut-off events. [2024-11-17 03:06:16,579 INFO L125 PetriNetUnfolderBase]: For 2459/2494 co-relation queries the response was YES. [2024-11-17 03:06:16,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 920 events. 427/920 cut-off events. For 2459/2494 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5310 event pairs, 74 based on Foata normal form. 47/875 useless extension candidates. Maximal degree in co-relation 2666. Up to 223 conditions per place. [2024-11-17 03:06:16,583 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 43 selfloop transitions, 20 changer transitions 28/99 dead transitions. [2024-11-17 03:06:16,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 718 flow [2024-11-17 03:06:16,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:06:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:06:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-11-17 03:06:16,584 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-11-17 03:06:16,584 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 308 flow. Second operand 10 states and 185 transitions. [2024-11-17 03:06:16,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 718 flow [2024-11-17 03:06:16,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 672 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-11-17 03:06:16,591 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 389 flow [2024-11-17 03:06:16,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=389, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2024-11-17 03:06:16,592 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2024-11-17 03:06:16,592 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 389 flow [2024-11-17 03:06:16,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:16,592 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:16,592 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:16,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:06:16,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:16,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 93456875, now seen corresponding path program 1 times [2024-11-17 03:06:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954898814] [2024-11-17 03:06:16,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:16,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:16,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954898814] [2024-11-17 03:06:16,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954898814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:06:16,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650572255] [2024-11-17 03:06:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:16,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:06:16,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:16,690 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-17 03:06:16,692 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-17 03:06:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:16,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 03:06:16,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:16,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:16,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650572255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:16,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:06:16,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-17 03:06:16,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187658341] [2024-11-17 03:06:16,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:16,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:06:16,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:16,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:06:16,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:06:16,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:16,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 389 flow. Second operand has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 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-17 03:06:16,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:16,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:16,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:17,347 INFO L124 PetriNetUnfolderBase]: 643/1379 cut-off events. [2024-11-17 03:06:17,347 INFO L125 PetriNetUnfolderBase]: For 6614/6691 co-relation queries the response was YES. [2024-11-17 03:06:17,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4586 conditions, 1379 events. 643/1379 cut-off events. For 6614/6691 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7910 event pairs, 59 based on Foata normal form. 65/1319 useless extension candidates. Maximal degree in co-relation 4557. Up to 171 conditions per place. [2024-11-17 03:06:17,355 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 65 selfloop transitions, 35 changer transitions 56/164 dead transitions. [2024-11-17 03:06:17,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 164 transitions, 1369 flow [2024-11-17 03:06:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 03:06:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-17 03:06:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 350 transitions. [2024-11-17 03:06:17,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2024-11-17 03:06:17,357 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 389 flow. Second operand 19 states and 350 transitions. [2024-11-17 03:06:17,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 164 transitions, 1369 flow [2024-11-17 03:06:17,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 164 transitions, 1308 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-11-17 03:06:17,367 INFO L231 Difference]: Finished difference. Result has 88 places, 66 transitions, 713 flow [2024-11-17 03:06:17,367 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=713, PETRI_PLACES=88, PETRI_TRANSITIONS=66} [2024-11-17 03:06:17,367 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2024-11-17 03:06:17,368 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 66 transitions, 713 flow [2024-11-17 03:06:17,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 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-17 03:06:17,368 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:17,368 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:17,381 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-17 03:06:17,569 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-17 03:06:17,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:17,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2108792713, now seen corresponding path program 1 times [2024-11-17 03:06:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678129473] [2024-11-17 03:06:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:17,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:06:17,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:17,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678129473] [2024-11-17 03:06:17,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678129473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:06:17,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448951805] [2024-11-17 03:06:17,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:17,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:06:17,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:17,735 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-17 03:06:17,736 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-17 03:06:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:17,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:06:17,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:06:17,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:06:18,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448951805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:18,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:06:18,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-17 03:06:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430236834] [2024-11-17 03:06:18,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:18,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 03:06:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:18,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 03:06:18,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-17 03:06:18,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:18,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 66 transitions, 713 flow. Second operand has 17 states, 17 states have (on average 13.352941176470589) internal successors, (227), 17 states have internal predecessors, (227), 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-17 03:06:18,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:18,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:18,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:18,516 INFO L124 PetriNetUnfolderBase]: 841/1913 cut-off events. [2024-11-17 03:06:18,516 INFO L125 PetriNetUnfolderBase]: For 17403/17544 co-relation queries the response was YES. [2024-11-17 03:06:18,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7276 conditions, 1913 events. 841/1913 cut-off events. For 17403/17544 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 11140 event pairs, 203 based on Foata normal form. 105/1803 useless extension candidates. Maximal degree in co-relation 7239. Up to 720 conditions per place. [2024-11-17 03:06:18,526 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 92 selfloop transitions, 27 changer transitions 89/216 dead transitions. [2024-11-17 03:06:18,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 216 transitions, 2287 flow [2024-11-17 03:06:18,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-17 03:06:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-17 03:06:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 451 transitions. [2024-11-17 03:06:18,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5154285714285715 [2024-11-17 03:06:18,529 INFO L175 Difference]: Start difference. First operand has 88 places, 66 transitions, 713 flow. Second operand 25 states and 451 transitions. [2024-11-17 03:06:18,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 216 transitions, 2287 flow [2024-11-17 03:06:18,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 216 transitions, 1799 flow, removed 229 selfloop flow, removed 10 redundant places. [2024-11-17 03:06:18,544 INFO L231 Difference]: Finished difference. Result has 116 places, 80 transitions, 792 flow [2024-11-17 03:06:18,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=792, PETRI_PLACES=116, PETRI_TRANSITIONS=80} [2024-11-17 03:06:18,545 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 82 predicate places. [2024-11-17 03:06:18,545 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 80 transitions, 792 flow [2024-11-17 03:06:18,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.352941176470589) internal successors, (227), 17 states have internal predecessors, (227), 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-17 03:06:18,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:18,546 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:18,558 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-17 03:06:18,746 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-17 03:06:18,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:18,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:18,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1685972933, now seen corresponding path program 2 times [2024-11-17 03:06:18,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:18,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961172974] [2024-11-17 03:06:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:06:18,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:18,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961172974] [2024-11-17 03:06:18,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961172974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:06:18,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293028819] [2024-11-17 03:06:18,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:06:18,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:06:18,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:18,852 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-17 03:06:18,853 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-17 03:06:18,901 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:06:18,901 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:06:18,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:06:18,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:06:18,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:06:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293028819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:19,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:06:19,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-17 03:06:19,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522200563] [2024-11-17 03:06:19,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:19,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 03:06:19,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 03:06:19,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-17 03:06:19,105 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:19,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 80 transitions, 792 flow. Second operand has 17 states, 17 states have (on average 13.352941176470589) internal successors, (227), 17 states have internal predecessors, (227), 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-17 03:06:19,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:19,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:19,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:19,946 INFO L124 PetriNetUnfolderBase]: 1453/3323 cut-off events. [2024-11-17 03:06:19,947 INFO L125 PetriNetUnfolderBase]: For 60376/60847 co-relation queries the response was YES. [2024-11-17 03:06:19,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14586 conditions, 3323 events. 1453/3323 cut-off events. For 60376/60847 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 23345 event pairs, 138 based on Foata normal form. 129/3143 useless extension candidates. Maximal degree in co-relation 14535. Up to 484 conditions per place. [2024-11-17 03:06:19,969 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 127 selfloop transitions, 82 changer transitions 91/308 dead transitions. [2024-11-17 03:06:19,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 308 transitions, 3746 flow [2024-11-17 03:06:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-17 03:06:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-17 03:06:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 585 transitions. [2024-11-17 03:06:19,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5223214285714286 [2024-11-17 03:06:19,973 INFO L175 Difference]: Start difference. First operand has 116 places, 80 transitions, 792 flow. Second operand 32 states and 585 transitions. [2024-11-17 03:06:19,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 308 transitions, 3746 flow [2024-11-17 03:06:20,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 308 transitions, 3149 flow, removed 289 selfloop flow, removed 13 redundant places. [2024-11-17 03:06:20,026 INFO L231 Difference]: Finished difference. Result has 148 places, 126 transitions, 1583 flow [2024-11-17 03:06:20,027 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1583, PETRI_PLACES=148, PETRI_TRANSITIONS=126} [2024-11-17 03:06:20,028 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 114 predicate places. [2024-11-17 03:06:20,028 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 126 transitions, 1583 flow [2024-11-17 03:06:20,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.352941176470589) internal successors, (227), 17 states have internal predecessors, (227), 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-17 03:06:20,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:20,029 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:20,047 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-17 03:06:20,229 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-17 03:06:20,230 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:20,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash 378181055, now seen corresponding path program 3 times [2024-11-17 03:06:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:20,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929103517] [2024-11-17 03:06:20,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:20,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:06:20,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:20,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929103517] [2024-11-17 03:06:20,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929103517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:06:20,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161174937] [2024-11-17 03:06:20,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:06:20,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:06:20,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:20,351 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-17 03:06:20,352 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-17 03:06:20,398 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-17 03:06:20,398 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:06:20,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:06:20,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:06:20,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:06:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161174937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:20,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:06:20,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-17 03:06:20,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626518818] [2024-11-17 03:06:20,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:20,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 03:06:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:20,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 03:06:20,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-17 03:06:20,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:20,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 126 transitions, 1583 flow. Second operand has 17 states, 17 states have (on average 13.352941176470589) internal successors, (227), 17 states have internal predecessors, (227), 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-17 03:06:20,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:20,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:20,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:21,627 INFO L124 PetriNetUnfolderBase]: 2047/4664 cut-off events. [2024-11-17 03:06:21,627 INFO L125 PetriNetUnfolderBase]: For 150584/151039 co-relation queries the response was YES. [2024-11-17 03:06:21,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23540 conditions, 4664 events. 2047/4664 cut-off events. For 150584/151039 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 35271 event pairs, 112 based on Foata normal form. 183/4417 useless extension candidates. Maximal degree in co-relation 23474. Up to 561 conditions per place. [2024-11-17 03:06:21,730 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 131 selfloop transitions, 129 changer transitions 113/381 dead transitions. [2024-11-17 03:06:21,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 381 transitions, 5740 flow [2024-11-17 03:06:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-17 03:06:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-11-17 03:06:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 640 transitions. [2024-11-17 03:06:21,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-11-17 03:06:21,732 INFO L175 Difference]: Start difference. First operand has 148 places, 126 transitions, 1583 flow. Second operand 35 states and 640 transitions. [2024-11-17 03:06:21,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 381 transitions, 5740 flow [2024-11-17 03:06:21,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 381 transitions, 4887 flow, removed 410 selfloop flow, removed 15 redundant places. [2024-11-17 03:06:21,895 INFO L231 Difference]: Finished difference. Result has 180 places, 173 transitions, 2505 flow [2024-11-17 03:06:21,896 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2505, PETRI_PLACES=180, PETRI_TRANSITIONS=173} [2024-11-17 03:06:21,897 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 146 predicate places. [2024-11-17 03:06:21,897 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 173 transitions, 2505 flow [2024-11-17 03:06:21,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.352941176470589) internal successors, (227), 17 states have internal predecessors, (227), 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-17 03:06:21,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:21,898 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:21,918 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-17 03:06:22,099 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-17 03:06:22,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:22,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2128271979, now seen corresponding path program 4 times [2024-11-17 03:06:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:22,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600450926] [2024-11-17 03:06:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:22,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:06:22,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600450926] [2024-11-17 03:06:22,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600450926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:06:22,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32941851] [2024-11-17 03:06:22,265 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 03:06:22,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:06:22,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:22,270 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-17 03:06:22,272 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-17 03:06:22,322 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 03:06:22,323 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:06:22,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 03:06:22,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:22,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:22,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32941851] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:22,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:06:22,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2024-11-17 03:06:22,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912788828] [2024-11-17 03:06:22,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:22,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 03:06:22,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:06:22,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 03:06:22,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-17 03:06:22,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:22,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 173 transitions, 2505 flow. Second operand has 16 states, 16 states have (on average 12.8125) internal successors, (205), 16 states have internal predecessors, (205), 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-17 03:06:22,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:22,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:22,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:23,540 INFO L124 PetriNetUnfolderBase]: 2569/5708 cut-off events. [2024-11-17 03:06:23,540 INFO L125 PetriNetUnfolderBase]: For 241130/241541 co-relation queries the response was YES. [2024-11-17 03:06:23,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31608 conditions, 5708 events. 2569/5708 cut-off events. For 241130/241541 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 43850 event pairs, 122 based on Foata normal form. 170/5379 useless extension candidates. Maximal degree in co-relation 31531. Up to 729 conditions per place. [2024-11-17 03:06:23,592 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 119 selfloop transitions, 162 changer transitions 61/350 dead transitions. [2024-11-17 03:06:23,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 350 transitions, 6416 flow [2024-11-17 03:06:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 03:06:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-17 03:06:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 439 transitions. [2024-11-17 03:06:23,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5226190476190476 [2024-11-17 03:06:23,594 INFO L175 Difference]: Start difference. First operand has 180 places, 173 transitions, 2505 flow. Second operand 24 states and 439 transitions. [2024-11-17 03:06:23,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 350 transitions, 6416 flow [2024-11-17 03:06:24,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 350 transitions, 4945 flow, removed 705 selfloop flow, removed 19 redundant places. [2024-11-17 03:06:24,093 INFO L231 Difference]: Finished difference. Result has 187 places, 222 transitions, 3302 flow [2024-11-17 03:06:24,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3302, PETRI_PLACES=187, PETRI_TRANSITIONS=222} [2024-11-17 03:06:24,097 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 153 predicate places. [2024-11-17 03:06:24,097 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 222 transitions, 3302 flow [2024-11-17 03:06:24,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.8125) internal successors, (205), 16 states have internal predecessors, (205), 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-17 03:06:24,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:24,098 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:24,110 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-17 03:06:24,298 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-17 03:06:24,299 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:24,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:24,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1955900001, now seen corresponding path program 5 times [2024-11-17 03:06:24,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:06:24,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633565309] [2024-11-17 03:06:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:06:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:06:24,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:06:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:06:24,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:06:24,343 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:06:24,345 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-17 03:06:24,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-17 03:06:24,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-17 03:06:24,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-17 03:06:24,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:06:24,347 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1] [2024-11-17 03:06:24,400 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:06:24,401 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:06:24,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:06:24 BasicIcfg [2024-11-17 03:06:24,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:06:24,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:06:24,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:06:24,408 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:06:24,408 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:06:14" (3/4) ... [2024-11-17 03:06:24,410 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:06:24,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:06:24,411 INFO L158 Benchmark]: Toolchain (without parser) took 10739.87ms. Allocated memory was 188.7MB in the beginning and 612.4MB in the end (delta: 423.6MB). Free memory was 113.0MB in the beginning and 392.2MB in the end (delta: -279.2MB). Peak memory consumption was 146.9MB. Max. memory is 16.1GB. [2024-11-17 03:06:24,412 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:06:24,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.58ms. Allocated memory is still 188.7MB. Free memory was 112.7MB in the beginning and 155.9MB in the end (delta: -43.1MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-11-17 03:06:24,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.85ms. Allocated memory is still 188.7MB. Free memory was 155.8MB in the beginning and 157.4MB in the end (delta: -1.6MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-17 03:06:24,412 INFO L158 Benchmark]: Boogie Preprocessor took 32.94ms. Allocated memory is still 188.7MB. Free memory was 157.4MB in the beginning and 156.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:06:24,414 INFO L158 Benchmark]: IcfgBuilder took 348.56ms. Allocated memory is still 188.7MB. Free memory was 156.4MB in the beginning and 136.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-17 03:06:24,414 INFO L158 Benchmark]: TraceAbstraction took 9885.78ms. Allocated memory was 188.7MB in the beginning and 612.4MB in the end (delta: 423.6MB). Free memory was 135.4MB in the beginning and 392.2MB in the end (delta: -256.8MB). Peak memory consumption was 167.9MB. Max. memory is 16.1GB. [2024-11-17 03:06:24,414 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 612.4MB. Free memory is still 392.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:06:24,415 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.11ms. Allocated memory is still 188.7MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.58ms. Allocated memory is still 188.7MB. Free memory was 112.7MB in the beginning and 155.9MB in the end (delta: -43.1MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.85ms. Allocated memory is still 188.7MB. Free memory was 155.8MB in the beginning and 157.4MB in the end (delta: -1.6MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.94ms. Allocated memory is still 188.7MB. Free memory was 157.4MB in the beginning and 156.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 348.56ms. Allocated memory is still 188.7MB. Free memory was 156.4MB in the beginning and 136.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9885.78ms. Allocated memory was 188.7MB in the beginning and 612.4MB in the end (delta: 423.6MB). Free memory was 135.4MB in the beginning and 392.2MB in the end (delta: -256.8MB). Peak memory consumption was 167.9MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 612.4MB. Free memory is still 392.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)=49, \old(argv)={50:51}, argc=49, i=3, id1=2, 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] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, 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=7, id1=2, id2=3, 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=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] [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] [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=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] [L704] COND TRUE 2 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] [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=2, id2=3, 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] [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=2, id2=3, 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, 46 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: 9.7s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1755 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1747 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2520 IncrementalHoareTripleChecker+Invalid, 2625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 2 mSDtfsCounter, 2520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 304 SyntacticMatches, 8 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3302occurred in iteration=11, InterpolantAutomatonStates: 180, 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.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 2321 SizeOfPredicates, 32 NumberOfNonLiveVariables, 560 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 27/396 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-17 03:06:24,434 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.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:06:26,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:06:26,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:06:26,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:06:26,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:06:26,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:06:26,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:06:26,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:06:26,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:06:26,316 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:06:26,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:06:26,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:06:26,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:06:26,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:06:26,318 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:06:26,318 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:06:26,319 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:06:26,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:06:26,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:06:26,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:06:26,320 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:06:26,320 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:06:26,320 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:06:26,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:06:26,321 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:06:26,321 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:06:26,321 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:06:26,321 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:06:26,321 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:06:26,322 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:06:26,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:06:26,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:06:26,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:06:26,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:06:26,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:06:26,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:06:26,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:06:26,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:06:26,324 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:06:26,324 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:06:26,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:06:26,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:06:26,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:06:26,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:06:26,325 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-17 03:06:26,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:06:26,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:06:26,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:06:26,595 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:06:26,595 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:06:26,596 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-17 03:06:27,842 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:06:28,086 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:06:28,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-11-17 03:06:28,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0956bad/9f52a6c621694fbea5a2d8bba4858044/FLAGc4b1cc001 [2024-11-17 03:06:28,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0956bad/9f52a6c621694fbea5a2d8bba4858044 [2024-11-17 03:06:28,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:06:28,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:06:28,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:06:28,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:06:28,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:06:28,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f059286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28, skipping insertion in model container [2024-11-17 03:06:28,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:06:28,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:06:28,748 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:06:28,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:06:28,822 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:06:28,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28 WrapperNode [2024-11-17 03:06:28,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:06:28,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:06:28,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:06:28,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:06:28,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,868 INFO L138 Inliner]: procedures = 169, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2024-11-17 03:06:28,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:06:28,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:06:28,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:06:28,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:06:28,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,888 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-17 03:06:28,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:06:28,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:06:28,906 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:06:28,906 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:06:28,907 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (1/1) ... [2024-11-17 03:06:28,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:06:28,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:06:28,934 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-17 03:06:28,936 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-17 03:06:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-17 03:06:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-17 03:06:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-17 03:06:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-17 03:06:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:06:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:06:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:06:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:06:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:06:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:06:28,968 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:06:29,075 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:06:29,077 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:06:29,188 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:06:29,188 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:06:29,262 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:06:29,263 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:06:29,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:06:29 BoogieIcfgContainer [2024-11-17 03:06:29,263 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:06:29,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:06:29,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:06:29,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:06:29,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:06:28" (1/3) ... [2024-11-17 03:06:29,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a052a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:06:29, skipping insertion in model container [2024-11-17 03:06:29,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:06:28" (2/3) ... [2024-11-17 03:06:29,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a052a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:06:29, skipping insertion in model container [2024-11-17 03:06:29,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:06:29" (3/3) ... [2024-11-17 03:06:29,271 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-11-17 03:06:29,284 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:06:29,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 03:06:29,285 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:06:29,334 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:06:29,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 78 flow [2024-11-17 03:06:29,386 INFO L124 PetriNetUnfolderBase]: 6/33 cut-off events. [2024-11-17 03:06:29,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:06:29,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 6/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-11-17 03:06:29,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 35 transitions, 78 flow [2024-11-17 03:06:29,398 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 33 transitions, 72 flow [2024-11-17 03:06:29,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:06:29,414 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;@2862b45f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:06:29,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-17 03:06:29,422 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:06:29,422 INFO L124 PetriNetUnfolderBase]: 6/30 cut-off events. [2024-11-17 03:06:29,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:06:29,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:29,423 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:29,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:29,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1239655755, now seen corresponding path program 1 times [2024-11-17 03:06:29,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:29,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535985920] [2024-11-17 03:06:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:29,437 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-17 03:06:29,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:29,438 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-17 03:06:29,439 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-17 03:06:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:29,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:06:29,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:29,541 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-17 03:06:29,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:29,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:29,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535985920] [2024-11-17 03:06:29,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535985920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:29,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:29,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:06:29,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980946689] [2024-11-17 03:06:29,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:29,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:06:29,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:29,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:06:29,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:06:29,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:29,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 72 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-17 03:06:29,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:29,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:29,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:29,656 INFO L124 PetriNetUnfolderBase]: 217/401 cut-off events. [2024-11-17 03:06:29,656 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:06:29,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 401 events. 217/401 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1969 event pairs, 159 based on Foata normal form. 90/466 useless extension candidates. Maximal degree in co-relation 743. Up to 338 conditions per place. [2024-11-17 03:06:29,662 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 15 selfloop transitions, 1 changer transitions 2/27 dead transitions. [2024-11-17 03:06:29,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 96 flow [2024-11-17 03:06:29,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:06:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:06:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-11-17 03:06:29,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-17 03:06:29,673 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 72 flow. Second operand 3 states and 56 transitions. [2024-11-17 03:06:29,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 96 flow [2024-11-17 03:06:29,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:06:29,676 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 56 flow [2024-11-17 03:06:29,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2024-11-17 03:06:29,681 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2024-11-17 03:06:29,681 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 56 flow [2024-11-17 03:06:29,681 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-17 03:06:29,681 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:29,681 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:29,685 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-17 03:06:29,882 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-17 03:06:29,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:29,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1239655395, now seen corresponding path program 1 times [2024-11-17 03:06:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:29,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563208015] [2024-11-17 03:06:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:29,885 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-17 03:06:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:29,886 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-17 03:06:29,887 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-17 03:06:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:29,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:06:29,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:30,060 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-17 03:06:30,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:30,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:30,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563208015] [2024-11-17 03:06:30,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563208015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:30,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:30,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:06:30,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003085518] [2024-11-17 03:06:30,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:30,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:06:30,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:30,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:06:30,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:06:30,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:30,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-17 03:06:30,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:30,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:30,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:30,258 INFO L124 PetriNetUnfolderBase]: 328/632 cut-off events. [2024-11-17 03:06:30,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:06:30,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 632 events. 328/632 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3305 event pairs, 45 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 1159. Up to 243 conditions per place. [2024-11-17 03:06:30,262 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 29 selfloop transitions, 7 changer transitions 28/72 dead transitions. [2024-11-17 03:06:30,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 72 transitions, 280 flow [2024-11-17 03:06:30,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:06:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:06:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-11-17 03:06:30,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2024-11-17 03:06:30,264 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 8 states and 155 transitions. [2024-11-17 03:06:30,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 72 transitions, 280 flow [2024-11-17 03:06:30,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 72 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:06:30,266 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 108 flow [2024-11-17 03:06:30,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2024-11-17 03:06:30,267 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2024-11-17 03:06:30,267 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 108 flow [2024-11-17 03:06:30,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-17 03:06:30,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:30,267 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:30,271 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 (3)] Forceful destruction successful, exit code 0 [2024-11-17 03:06:30,468 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-17 03:06:30,468 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:30,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:30,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1014666940, now seen corresponding path program 1 times [2024-11-17 03:06:30,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:30,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457633069] [2024-11-17 03:06:30,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:30,469 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-17 03:06:30,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:30,472 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-17 03:06:30,473 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-17 03:06:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:30,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:06:30,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:30,583 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-17 03:06:30,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:30,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:30,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457633069] [2024-11-17 03:06:30,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457633069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:30,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:30,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:06:30,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475571654] [2024-11-17 03:06:30,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:30,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:06:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:30,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:06:30,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:06:30,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:30,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-17 03:06:30,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:30,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:30,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:30,752 INFO L124 PetriNetUnfolderBase]: 247/512 cut-off events. [2024-11-17 03:06:30,753 INFO L125 PetriNetUnfolderBase]: For 403/418 co-relation queries the response was YES. [2024-11-17 03:06:30,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 512 events. 247/512 cut-off events. For 403/418 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2643 event pairs, 50 based on Foata normal form. 18/480 useless extension candidates. Maximal degree in co-relation 1228. Up to 190 conditions per place. [2024-11-17 03:06:30,756 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 30 selfloop transitions, 9 changer transitions 16/63 dead transitions. [2024-11-17 03:06:30,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 324 flow [2024-11-17 03:06:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:06:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:06:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-11-17 03:06:30,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2024-11-17 03:06:30,757 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 108 flow. Second operand 7 states and 131 transitions. [2024-11-17 03:06:30,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 324 flow [2024-11-17 03:06:30,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 320 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-17 03:06:30,765 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 151 flow [2024-11-17 03:06:30,765 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=151, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2024-11-17 03:06:30,766 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2024-11-17 03:06:30,766 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 151 flow [2024-11-17 03:06:30,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-17 03:06:30,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:30,766 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:30,771 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-17 03:06:30,967 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-17 03:06:30,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:30,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1165576598, now seen corresponding path program 1 times [2024-11-17 03:06:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:30,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003395656] [2024-11-17 03:06:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:30,968 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-17 03:06:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:30,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:06:30,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 03:06:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:31,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:06:31,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:31,061 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-17 03:06:31,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:31,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:31,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003395656] [2024-11-17 03:06:31,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003395656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:31,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:31,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:06:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082364042] [2024-11-17 03:06:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:31,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:06:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:06:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:06:31,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:31,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-17 03:06:31,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:31,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:31,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:31,256 INFO L124 PetriNetUnfolderBase]: 391/830 cut-off events. [2024-11-17 03:06:31,257 INFO L125 PetriNetUnfolderBase]: For 1176/1191 co-relation queries the response was YES. [2024-11-17 03:06:31,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 830 events. 391/830 cut-off events. For 1176/1191 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4725 event pairs, 95 based on Foata normal form. 33/787 useless extension candidates. Maximal degree in co-relation 2203. Up to 264 conditions per place. [2024-11-17 03:06:31,261 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 47 selfloop transitions, 11 changer transitions 20/86 dead transitions. [2024-11-17 03:06:31,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 525 flow [2024-11-17 03:06:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:06:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:06:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-11-17 03:06:31,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-11-17 03:06:31,262 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 151 flow. Second operand 9 states and 171 transitions. [2024-11-17 03:06:31,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 525 flow [2024-11-17 03:06:31,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 486 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-11-17 03:06:31,268 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 244 flow [2024-11-17 03:06:31,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-11-17 03:06:31,268 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2024-11-17 03:06:31,268 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 244 flow [2024-11-17 03:06:31,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-17 03:06:31,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:31,269 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:31,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 03:06:31,473 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-17 03:06:31,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:31,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 815259488, now seen corresponding path program 2 times [2024-11-17 03:06:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:31,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740529213] [2024-11-17 03:06:31,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:06:31,474 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-17 03:06:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:31,475 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-17 03:06:31,476 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-17 03:06:31,509 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:06:31,510 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:06:31,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:06:31,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:31,577 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-17 03:06:31,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:31,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:31,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740529213] [2024-11-17 03:06:31,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740529213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:31,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:31,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:06:31,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475966092] [2024-11-17 03:06:31,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:31,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:06:31,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:06:31,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:06:31,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:31,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-17 03:06:31,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:31,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:31,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:31,782 INFO L124 PetriNetUnfolderBase]: 346/767 cut-off events. [2024-11-17 03:06:31,782 INFO L125 PetriNetUnfolderBase]: For 2094/2115 co-relation queries the response was YES. [2024-11-17 03:06:31,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 767 events. 346/767 cut-off events. For 2094/2115 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4444 event pairs, 88 based on Foata normal form. 51/736 useless extension candidates. Maximal degree in co-relation 2278. Up to 273 conditions per place. [2024-11-17 03:06:31,785 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 40 selfloop transitions, 12 changer transitions 30/90 dead transitions. [2024-11-17 03:06:31,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 663 flow [2024-11-17 03:06:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:06:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:06:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-11-17 03:06:31,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5301587301587302 [2024-11-17 03:06:31,790 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 244 flow. Second operand 9 states and 167 transitions. [2024-11-17 03:06:31,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 663 flow [2024-11-17 03:06:31,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 603 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-11-17 03:06:31,800 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 286 flow [2024-11-17 03:06:31,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=286, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2024-11-17 03:06:31,804 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2024-11-17 03:06:31,804 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 286 flow [2024-11-17 03:06:31,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-17 03:06:31,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:31,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:31,811 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-17 03:06:32,005 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-17 03:06:32,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:32,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:32,006 INFO L85 PathProgramCache]: Analyzing trace with hash -934560433, now seen corresponding path program 1 times [2024-11-17 03:06:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965600224] [2024-11-17 03:06:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:32,007 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-17 03:06:32,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:32,008 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-17 03:06:32,010 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-17 03:06:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:32,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:06:32,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:32,095 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-17 03:06:32,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:32,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:32,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965600224] [2024-11-17 03:06:32,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965600224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:32,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:32,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:06:32,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033941106] [2024-11-17 03:06:32,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:32,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:06:32,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:32,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:06:32,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:06:32,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:32,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:32,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:32,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:32,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:32,328 INFO L124 PetriNetUnfolderBase]: 427/926 cut-off events. [2024-11-17 03:06:32,328 INFO L125 PetriNetUnfolderBase]: For 3570/3609 co-relation queries the response was YES. [2024-11-17 03:06:32,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 926 events. 427/926 cut-off events. For 3570/3609 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5426 event pairs, 122 based on Foata normal form. 27/859 useless extension candidates. Maximal degree in co-relation 2994. Up to 316 conditions per place. [2024-11-17 03:06:32,332 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 51 selfloop transitions, 12 changer transitions 26/97 dead transitions. [2024-11-17 03:06:32,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 760 flow [2024-11-17 03:06:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:06:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:06:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-11-17 03:06:32,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-11-17 03:06:32,333 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 286 flow. Second operand 10 states and 188 transitions. [2024-11-17 03:06:32,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 760 flow [2024-11-17 03:06:32,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 97 transitions, 726 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-11-17 03:06:32,340 INFO L231 Difference]: Finished difference. Result has 72 places, 47 transitions, 353 flow [2024-11-17 03:06:32,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=353, PETRI_PLACES=72, PETRI_TRANSITIONS=47} [2024-11-17 03:06:32,340 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2024-11-17 03:06:32,340 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 47 transitions, 353 flow [2024-11-17 03:06:32,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:32,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:32,341 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:32,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-17 03:06:32,541 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-17 03:06:32,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:32,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash -930903645, now seen corresponding path program 2 times [2024-11-17 03:06:32,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:32,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369938368] [2024-11-17 03:06:32,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:06:32,543 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-17 03:06:32,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:32,544 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-17 03:06:32,545 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-17 03:06:32,577 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:06:32,577 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:06:32,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:06:32,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:32,632 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-17 03:06:32,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:32,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369938368] [2024-11-17 03:06:32,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369938368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:32,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:32,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:06:32,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969377087] [2024-11-17 03:06:32,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:32,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:06:32,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:32,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:06:32,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:06:32,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:32,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 47 transitions, 353 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:32,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:32,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:32,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:32,880 INFO L124 PetriNetUnfolderBase]: 463/1037 cut-off events. [2024-11-17 03:06:32,880 INFO L125 PetriNetUnfolderBase]: For 6724/6793 co-relation queries the response was YES. [2024-11-17 03:06:32,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3755 conditions, 1037 events. 463/1037 cut-off events. For 6724/6793 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6384 event pairs, 120 based on Foata normal form. 27/961 useless extension candidates. Maximal degree in co-relation 3723. Up to 340 conditions per place. [2024-11-17 03:06:32,884 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 56 selfloop transitions, 17 changer transitions 30/111 dead transitions. [2024-11-17 03:06:32,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 111 transitions, 986 flow [2024-11-17 03:06:32,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:06:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:06:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2024-11-17 03:06:32,886 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-11-17 03:06:32,886 INFO L175 Difference]: Start difference. First operand has 72 places, 47 transitions, 353 flow. Second operand 12 states and 222 transitions. [2024-11-17 03:06:32,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 111 transitions, 986 flow [2024-11-17 03:06:32,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 111 transitions, 850 flow, removed 59 selfloop flow, removed 7 redundant places. [2024-11-17 03:06:32,896 INFO L231 Difference]: Finished difference. Result has 79 places, 52 transitions, 403 flow [2024-11-17 03:06:32,896 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=403, PETRI_PLACES=79, PETRI_TRANSITIONS=52} [2024-11-17 03:06:32,896 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 45 predicate places. [2024-11-17 03:06:32,896 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 52 transitions, 403 flow [2024-11-17 03:06:32,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:32,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:32,897 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:32,901 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-17 03:06:33,097 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-17 03:06:33,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:33,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:33,098 INFO L85 PathProgramCache]: Analyzing trace with hash -871231649, now seen corresponding path program 3 times [2024-11-17 03:06:33,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:33,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463884794] [2024-11-17 03:06:33,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:06:33,098 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-17 03:06:33,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:33,101 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-17 03:06:33,101 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-17 03:06:33,131 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-17 03:06:33,132 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:06:33,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:06:33,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:33,216 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-17 03:06:33,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:33,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463884794] [2024-11-17 03:06:33,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463884794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:33,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:33,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:06:33,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261790681] [2024-11-17 03:06:33,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:33,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:06:33,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:33,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:06:33,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:06:33,220 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:33,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 52 transitions, 403 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:33,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:33,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:33,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:33,457 INFO L124 PetriNetUnfolderBase]: 436/992 cut-off events. [2024-11-17 03:06:33,457 INFO L125 PetriNetUnfolderBase]: For 6537/6600 co-relation queries the response was YES. [2024-11-17 03:06:33,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3482 conditions, 992 events. 436/992 cut-off events. For 6537/6600 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6106 event pairs, 152 based on Foata normal form. 33/919 useless extension candidates. Maximal degree in co-relation 3448. Up to 555 conditions per place. [2024-11-17 03:06:33,461 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 54 selfloop transitions, 9 changer transitions 29/100 dead transitions. [2024-11-17 03:06:33,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 883 flow [2024-11-17 03:06:33,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:06:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:06:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-11-17 03:06:33,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5228571428571429 [2024-11-17 03:06:33,463 INFO L175 Difference]: Start difference. First operand has 79 places, 52 transitions, 403 flow. Second operand 10 states and 183 transitions. [2024-11-17 03:06:33,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 883 flow [2024-11-17 03:06:33,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 100 transitions, 812 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-11-17 03:06:33,473 INFO L231 Difference]: Finished difference. Result has 83 places, 54 transitions, 413 flow [2024-11-17 03:06:33,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=413, PETRI_PLACES=83, PETRI_TRANSITIONS=54} [2024-11-17 03:06:33,474 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 49 predicate places. [2024-11-17 03:06:33,474 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 54 transitions, 413 flow [2024-11-17 03:06:33,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:33,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:33,475 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:33,480 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-17 03:06:33,675 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-17 03:06:33,676 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:33,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1073852833, now seen corresponding path program 4 times [2024-11-17 03:06:33,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:33,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717014347] [2024-11-17 03:06:33,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 03:06:33,677 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-17 03:06:33,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:33,679 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-17 03:06:33,680 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-17 03:06:33,708 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 03:06:33,709 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:06:33,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:06:33,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:33,753 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-17 03:06:33,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:06:33,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:33,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717014347] [2024-11-17 03:06:33,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717014347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:06:33,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:06:33,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:06:33,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503019407] [2024-11-17 03:06:33,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:06:33,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:06:33,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:33,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:06:33,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:06:33,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:33,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 54 transitions, 413 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:33,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:33,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:33,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:33,959 INFO L124 PetriNetUnfolderBase]: 463/1055 cut-off events. [2024-11-17 03:06:33,959 INFO L125 PetriNetUnfolderBase]: For 6842/6887 co-relation queries the response was YES. [2024-11-17 03:06:33,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3676 conditions, 1055 events. 463/1055 cut-off events. For 6842/6887 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6699 event pairs, 152 based on Foata normal form. 24/959 useless extension candidates. Maximal degree in co-relation 3640. Up to 456 conditions per place. [2024-11-17 03:06:33,963 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 54 selfloop transitions, 16 changer transitions 21/99 dead transitions. [2024-11-17 03:06:33,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 99 transitions, 891 flow [2024-11-17 03:06:33,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:06:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:06:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-11-17 03:06:33,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5301587301587302 [2024-11-17 03:06:33,964 INFO L175 Difference]: Start difference. First operand has 83 places, 54 transitions, 413 flow. Second operand 9 states and 167 transitions. [2024-11-17 03:06:33,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 99 transitions, 891 flow [2024-11-17 03:06:33,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 99 transitions, 835 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-11-17 03:06:33,973 INFO L231 Difference]: Finished difference. Result has 85 places, 57 transitions, 476 flow [2024-11-17 03:06:33,974 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=476, PETRI_PLACES=85, PETRI_TRANSITIONS=57} [2024-11-17 03:06:33,974 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2024-11-17 03:06:33,974 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 476 flow [2024-11-17 03:06:33,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-17 03:06:33,975 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:33,975 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:33,978 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-17 03:06:34,175 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-17 03:06:34,175 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:34,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash 800805281, now seen corresponding path program 1 times [2024-11-17 03:06:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:34,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378726556] [2024-11-17 03:06:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:34,176 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-17 03:06:34,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:34,179 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-17 03:06:34,179 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-17 03:06:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:34,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:06:34,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:34,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:34,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:34,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378726556] [2024-11-17 03:06:34,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378726556] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:34,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:06:34,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-17 03:06:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479972409] [2024-11-17 03:06:34,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:34,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:06:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:06:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:06:34,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:34,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 57 transitions, 476 flow. Second operand has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 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-17 03:06:34,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:34,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:34,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:35,133 INFO L124 PetriNetUnfolderBase]: 697/1496 cut-off events. [2024-11-17 03:06:35,134 INFO L125 PetriNetUnfolderBase]: For 15191/15330 co-relation queries the response was YES. [2024-11-17 03:06:35,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5987 conditions, 1496 events. 697/1496 cut-off events. For 15191/15330 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9063 event pairs, 36 based on Foata normal form. 63/1437 useless extension candidates. Maximal degree in co-relation 5950. Up to 191 conditions per place. [2024-11-17 03:06:35,141 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 69 selfloop transitions, 43 changer transitions 60/180 dead transitions. [2024-11-17 03:06:35,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 180 transitions, 1760 flow [2024-11-17 03:06:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 03:06:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-17 03:06:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 386 transitions. [2024-11-17 03:06:35,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5251700680272109 [2024-11-17 03:06:35,143 INFO L175 Difference]: Start difference. First operand has 85 places, 57 transitions, 476 flow. Second operand 21 states and 386 transitions. [2024-11-17 03:06:35,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 180 transitions, 1760 flow [2024-11-17 03:06:35,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 180 transitions, 1667 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-11-17 03:06:35,163 INFO L231 Difference]: Finished difference. Result has 107 places, 73 transitions, 893 flow [2024-11-17 03:06:35,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=893, PETRI_PLACES=107, PETRI_TRANSITIONS=73} [2024-11-17 03:06:35,164 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 73 predicate places. [2024-11-17 03:06:35,164 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 73 transitions, 893 flow [2024-11-17 03:06:35,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 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-17 03:06:35,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:35,164 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:35,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-17 03:06:35,367 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-17 03:06:35,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash 390732611, now seen corresponding path program 1 times [2024-11-17 03:06:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:35,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631145311] [2024-11-17 03:06:35,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:35,368 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-17 03:06:35,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:35,369 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-17 03:06:35,370 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-17 03:06:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:35,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:06:35,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:35,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:35,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:35,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631145311] [2024-11-17 03:06:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631145311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:35,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:06:35,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-17 03:06:35,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840789961] [2024-11-17 03:06:35,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:35,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:06:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:35,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:06:35,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:06:35,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:35,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 73 transitions, 893 flow. Second operand has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 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-17 03:06:35,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:35,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:35,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:36,181 INFO L124 PetriNetUnfolderBase]: 787/1799 cut-off events. [2024-11-17 03:06:36,181 INFO L125 PetriNetUnfolderBase]: For 28929/29076 co-relation queries the response was YES. [2024-11-17 03:06:36,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7912 conditions, 1799 events. 787/1799 cut-off events. For 28929/29076 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 11373 event pairs, 239 based on Foata normal form. 84/1682 useless extension candidates. Maximal degree in co-relation 7867. Up to 828 conditions per place. [2024-11-17 03:06:36,190 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 85 selfloop transitions, 19 changer transitions 67/179 dead transitions. [2024-11-17 03:06:36,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 179 transitions, 2259 flow [2024-11-17 03:06:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 03:06:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-17 03:06:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 345 transitions. [2024-11-17 03:06:36,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.518796992481203 [2024-11-17 03:06:36,193 INFO L175 Difference]: Start difference. First operand has 107 places, 73 transitions, 893 flow. Second operand 19 states and 345 transitions. [2024-11-17 03:06:36,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 179 transitions, 2259 flow [2024-11-17 03:06:36,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 179 transitions, 1705 flow, removed 258 selfloop flow, removed 14 redundant places. [2024-11-17 03:06:36,230 INFO L231 Difference]: Finished difference. Result has 119 places, 79 transitions, 774 flow [2024-11-17 03:06:36,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=774, PETRI_PLACES=119, PETRI_TRANSITIONS=79} [2024-11-17 03:06:36,231 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 85 predicate places. [2024-11-17 03:06:36,231 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 79 transitions, 774 flow [2024-11-17 03:06:36,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 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-17 03:06:36,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:36,232 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:36,235 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-17 03:06:36,432 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-17 03:06:36,432 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:36,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:36,433 INFO L85 PathProgramCache]: Analyzing trace with hash 683244213, now seen corresponding path program 2 times [2024-11-17 03:06:36,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:36,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787498306] [2024-11-17 03:06:36,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:06:36,433 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-17 03:06:36,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:36,434 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-17 03:06:36,435 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-17 03:06:36,465 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:06:36,465 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:06:36,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:06:36,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:36,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:36,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:36,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787498306] [2024-11-17 03:06:36,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787498306] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:36,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:06:36,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-17 03:06:36,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108341815] [2024-11-17 03:06:36,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:36,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:06:36,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:36,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:06:36,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:06:36,678 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:36,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 79 transitions, 774 flow. Second operand has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 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-17 03:06:36,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:36,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:36,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:37,625 INFO L124 PetriNetUnfolderBase]: 1246/2800 cut-off events. [2024-11-17 03:06:37,625 INFO L125 PetriNetUnfolderBase]: For 58076/58295 co-relation queries the response was YES. [2024-11-17 03:06:37,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13633 conditions, 2800 events. 1246/2800 cut-off events. For 58076/58295 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 19798 event pairs, 88 based on Foata normal form. 93/2643 useless extension candidates. Maximal degree in co-relation 13583. Up to 478 conditions per place. [2024-11-17 03:06:37,641 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 129 selfloop transitions, 54 changer transitions 59/250 dead transitions. [2024-11-17 03:06:37,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 250 transitions, 3250 flow [2024-11-17 03:06:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 03:06:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-17 03:06:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 502 transitions. [2024-11-17 03:06:37,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5312169312169313 [2024-11-17 03:06:37,643 INFO L175 Difference]: Start difference. First operand has 119 places, 79 transitions, 774 flow. Second operand 27 states and 502 transitions. [2024-11-17 03:06:37,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 250 transitions, 3250 flow [2024-11-17 03:06:37,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 250 transitions, 2743 flow, removed 241 selfloop flow, removed 12 redundant places. [2024-11-17 03:06:37,687 INFO L231 Difference]: Finished difference. Result has 143 places, 101 transitions, 1316 flow [2024-11-17 03:06:37,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1316, PETRI_PLACES=143, PETRI_TRANSITIONS=101} [2024-11-17 03:06:37,688 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 109 predicate places. [2024-11-17 03:06:37,688 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 101 transitions, 1316 flow [2024-11-17 03:06:37,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 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-17 03:06:37,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:37,688 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:37,695 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 (13)] Forceful destruction successful, exit code 0 [2024-11-17 03:06:37,891 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-17 03:06:37,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:37,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash 762281489, now seen corresponding path program 3 times [2024-11-17 03:06:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:37,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919864145] [2024-11-17 03:06:37,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:06:37,892 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-17 03:06:37,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:37,893 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-17 03:06:37,894 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-17 03:06:37,923 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 03:06:37,923 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:06:37,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:06:37,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:37,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:06:38,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:38,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919864145] [2024-11-17 03:06:38,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919864145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:38,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:06:38,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-17 03:06:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990137033] [2024-11-17 03:06:38,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:38,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:06:38,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:38,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:06:38,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:06:38,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:38,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 101 transitions, 1316 flow. Second operand has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 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-17 03:06:38,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:38,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:38,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:39,026 INFO L124 PetriNetUnfolderBase]: 1318/2945 cut-off events. [2024-11-17 03:06:39,026 INFO L125 PetriNetUnfolderBase]: For 92884/93126 co-relation queries the response was YES. [2024-11-17 03:06:39,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15587 conditions, 2945 events. 1318/2945 cut-off events. For 92884/93126 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 20894 event pairs, 132 based on Foata normal form. 218/2893 useless extension candidates. Maximal degree in co-relation 15527. Up to 454 conditions per place. [2024-11-17 03:06:39,042 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 99 selfloop transitions, 68 changer transitions 95/270 dead transitions. [2024-11-17 03:06:39,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 270 transitions, 4154 flow [2024-11-17 03:06:39,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-17 03:06:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-17 03:06:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 458 transitions. [2024-11-17 03:06:39,044 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5234285714285715 [2024-11-17 03:06:39,044 INFO L175 Difference]: Start difference. First operand has 143 places, 101 transitions, 1316 flow. Second operand 25 states and 458 transitions. [2024-11-17 03:06:39,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 270 transitions, 4154 flow [2024-11-17 03:06:39,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 270 transitions, 3319 flow, removed 402 selfloop flow, removed 14 redundant places. [2024-11-17 03:06:39,154 INFO L231 Difference]: Finished difference. Result has 162 places, 119 transitions, 1621 flow [2024-11-17 03:06:39,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1621, PETRI_PLACES=162, PETRI_TRANSITIONS=119} [2024-11-17 03:06:39,155 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 128 predicate places. [2024-11-17 03:06:39,155 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 119 transitions, 1621 flow [2024-11-17 03:06:39,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 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-17 03:06:39,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:39,155 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:39,180 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-17 03:06:39,377 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-17 03:06:39,377 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:39,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:39,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1051651345, now seen corresponding path program 1 times [2024-11-17 03:06:39,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:39,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450180435] [2024-11-17 03:06:39,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:06:39,378 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-17 03:06:39,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:39,381 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-17 03:06:39,383 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-17 03:06:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:06:39,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 03:06:39,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:06:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:06:39,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:06:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 03:06:39,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:06:39,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450180435] [2024-11-17 03:06:39,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450180435] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:06:39,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:06:39,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-17 03:06:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120487158] [2024-11-17 03:06:39,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:06:39,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 03:06:39,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:06:39,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 03:06:39,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-17 03:06:39,799 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-11-17 03:06:39,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 119 transitions, 1621 flow. Second operand has 19 states, 19 states have (on average 13.263157894736842) internal successors, (252), 19 states have internal predecessors, (252), 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-17 03:06:39,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:06:39,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-11-17 03:06:39,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:06:41,319 INFO L124 PetriNetUnfolderBase]: 1687/3713 cut-off events. [2024-11-17 03:06:41,320 INFO L125 PetriNetUnfolderBase]: For 127172/127619 co-relation queries the response was YES. [2024-11-17 03:06:41,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19772 conditions, 3713 events. 1687/3713 cut-off events. For 127172/127619 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25945 event pairs, 48 based on Foata normal form. 132/3533 useless extension candidates. Maximal degree in co-relation 19705. Up to 477 conditions per place. [2024-11-17 03:06:41,344 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 125 selfloop transitions, 111 changer transitions 105/349 dead transitions. [2024-11-17 03:06:41,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 349 transitions, 5349 flow [2024-11-17 03:06:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-17 03:06:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-17 03:06:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 659 transitions. [2024-11-17 03:06:41,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.523015873015873 [2024-11-17 03:06:41,347 INFO L175 Difference]: Start difference. First operand has 162 places, 119 transitions, 1621 flow. Second operand 36 states and 659 transitions. [2024-11-17 03:06:41,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 349 transitions, 5349 flow [2024-11-17 03:06:41,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 349 transitions, 4708 flow, removed 296 selfloop flow, removed 19 redundant places. [2024-11-17 03:06:41,569 INFO L231 Difference]: Finished difference. Result has 190 places, 158 transitions, 2543 flow [2024-11-17 03:06:41,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2543, PETRI_PLACES=190, PETRI_TRANSITIONS=158} [2024-11-17 03:06:41,570 INFO L277 CegarLoopForPetriNet]: 34 programPoint places, 156 predicate places. [2024-11-17 03:06:41,570 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 158 transitions, 2543 flow [2024-11-17 03:06:41,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.263157894736842) internal successors, (252), 19 states have internal predecessors, (252), 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-17 03:06:41,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:06:41,570 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:06:41,573 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 (15)] Ended with exit code 0 [2024-11-17 03:06:41,771 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-17 03:06:41,771 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-17 03:06:41,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:06:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 703273929, now seen corresponding path program 2 times [2024-11-17 03:06:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:06:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832910685] [2024-11-17 03:06:41,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:06:41,772 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-17 03:06:41,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:06:41,773 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-17 03:06:41,774 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-17 03:06:41,810 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:06:41,811 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 03:06:41,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:06:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:06:41,864 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 03:06:41,865 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:06:41,865 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-17 03:06:41,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-17 03:06:41,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-17 03:06:41,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-17 03:06:41,872 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-17 03:06:42,069 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-17 03:06:42,069 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1] [2024-11-17 03:06:42,106 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:06:42,106 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:06:42,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:06:42 BasicIcfg [2024-11-17 03:06:42,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:06:42,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:06:42,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:06:42,118 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:06:42,119 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:06:29" (3/4) ... [2024-11-17 03:06:42,120 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:06:42,121 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:06:42,121 INFO L158 Benchmark]: Toolchain (without parser) took 13697.30ms. Allocated memory was 71.3MB in the beginning and 360.7MB in the end (delta: 289.4MB). Free memory was 50.0MB in the beginning and 123.7MB in the end (delta: -73.7MB). Peak memory consumption was 216.1MB. Max. memory is 16.1GB. [2024-11-17 03:06:42,122 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 71.3MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:06:42,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.31ms. Allocated memory was 71.3MB in the beginning and 111.1MB in the end (delta: 39.8MB). Free memory was 49.8MB in the beginning and 85.4MB in the end (delta: -35.6MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-11-17 03:06:42,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.18ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:06:42,122 INFO L158 Benchmark]: Boogie Preprocessor took 35.69ms. Allocated memory is still 111.1MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:06:42,122 INFO L158 Benchmark]: IcfgBuilder took 357.54ms. Allocated memory is still 111.1MB. Free memory was 81.2MB in the beginning and 57.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 03:06:42,122 INFO L158 Benchmark]: TraceAbstraction took 12850.95ms. Allocated memory was 111.1MB in the beginning and 360.7MB in the end (delta: 249.6MB). Free memory was 57.0MB in the beginning and 123.7MB in the end (delta: -66.8MB). Peak memory consumption was 182.2MB. Max. memory is 16.1GB. [2024-11-17 03:06:42,122 INFO L158 Benchmark]: Witness Printer took 5.04ms. Allocated memory is still 360.7MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:06:42,123 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.69ms. Allocated memory is still 71.3MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.31ms. Allocated memory was 71.3MB in the beginning and 111.1MB in the end (delta: 39.8MB). Free memory was 49.8MB in the beginning and 85.4MB in the end (delta: -35.6MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.18ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.69ms. Allocated memory is still 111.1MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 357.54ms. Allocated memory is still 111.1MB. Free memory was 81.2MB in the beginning and 57.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12850.95ms. Allocated memory was 111.1MB in the beginning and 360.7MB in the end (delta: 249.6MB). Free memory was 57.0MB in the beginning and 123.7MB in the end (delta: -66.8MB). Peak memory consumption was 182.2MB. Max. memory is 16.1GB. * Witness Printer took 5.04ms. Allocated memory is still 360.7MB. Free memory is still 123.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)=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] [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] [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] [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: 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, 46 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: 12.7s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1707 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1700 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4189 IncrementalHoareTripleChecker+Invalid, 4272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 5 mSDtfsCounter, 4189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2543occurred 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, 1.8s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 2271 SizeOfPredicates, 44 NumberOfNonLiveVariables, 709 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 6/86 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-17 03:06:42,144 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