./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind2-1.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 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:26:27,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:26:27,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:26:27,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:26:27,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:26:27,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:26:27,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:26:27,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:26:27,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:26:27,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:26:27,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:26:27,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:26:27,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:26:27,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:26:27,614 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:26:27,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:26:27,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:26:27,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:26:27,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:26:27,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:26:27,617 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:26:27,618 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:26:27,618 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:26:27,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:26:27,619 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:26:27,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:26:27,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:26:27,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:26:27,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:26:27,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:26:27,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:26:27,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:26:27,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:26:27,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:27,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:26:27,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:26:27,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:26:27,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:26:27,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:26:27,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:26:27,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:26:27,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:26:27,625 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 -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2024-11-10 18:26:27,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:26:27,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:26:27,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:26:27,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:26:27,974 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:26:27,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-10 18:26:29,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:26:29,682 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:26:29,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-10 18:26:29,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddb0a65b/ec4b8e1b54824c6db9bd5da102479927/FLAG8ce3fa4c7 [2024-11-10 18:26:29,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddb0a65b/ec4b8e1b54824c6db9bd5da102479927 [2024-11-10 18:26:29,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:26:29,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:26:29,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:29,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:26:29,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:26:29,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:29" (1/1) ... [2024-11-10 18:26:29,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a6904a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:29, skipping insertion in model container [2024-11-10 18:26:29,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:29" (1/1) ... [2024-11-10 18:26:29,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:26:30,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:30,173 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:26:30,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:30,260 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:26:30,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30 WrapperNode [2024-11-10 18:26:30,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:30,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:30,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:26:30,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:26:30,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,312 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 83 [2024-11-10 18:26:30,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:30,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:26:30,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:26:30,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:26:30,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,351 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-10 18:26:30,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:26:30,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:26:30,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:26:30,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:26:30,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (1/1) ... [2024-11-10 18:26:30,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:30,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:30,434 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-10 18:26:30,438 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-10 18:26:30,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:26:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-10 18:26:30,484 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-10 18:26:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-10 18:26:30,484 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-10 18:26:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:26:30,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:26:30,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:26:30,486 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:26:30,665 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:26:30,668 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:26:30,803 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:26:30,803 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:26:30,916 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:26:30,916 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:26:30,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:30 BoogieIcfgContainer [2024-11-10 18:26:30,917 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:26:30,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:26:30,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:26:30,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:26:30,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:26:29" (1/3) ... [2024-11-10 18:26:30,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d41a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:30, skipping insertion in model container [2024-11-10 18:26:30,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:30" (2/3) ... [2024-11-10 18:26:30,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d41a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:30, skipping insertion in model container [2024-11-10 18:26:30,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:30" (3/3) ... [2024-11-10 18:26:30,928 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2024-11-10 18:26:30,943 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:26:30,943 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 18:26:30,944 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:26:30,995 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 18:26:31,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 44 transitions, 102 flow [2024-11-10 18:26:31,059 INFO L124 PetriNetUnfolderBase]: 8/42 cut-off events. [2024-11-10 18:26:31,060 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:26:31,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 42 events. 8/42 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-10 18:26:31,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 44 transitions, 102 flow [2024-11-10 18:26:31,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 41 transitions, 94 flow [2024-11-10 18:26:31,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:26:31,093 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;@1d958678, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:26:31,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 18:26:31,104 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:26:31,104 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-11-10 18:26:31,105 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 18:26:31,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:31,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:31,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:31,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2028047973, now seen corresponding path program 1 times [2024-11-10 18:26:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:31,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537126748] [2024-11-10 18:26:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:31,324 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-10 18:26:31,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:31,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537126748] [2024-11-10 18:26:31,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537126748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:31,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:31,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:26:31,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162109398] [2024-11-10 18:26:31,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:31,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:26:31,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:31,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:26:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:26:31,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-10 18:26:31,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:31,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:31,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-10 18:26:31,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:31,532 INFO L124 PetriNetUnfolderBase]: 169/393 cut-off events. [2024-11-10 18:26:31,533 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-10 18:26:31,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 393 events. 169/393 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1787 event pairs, 138 based on Foata normal form. 93/473 useless extension candidates. Maximal degree in co-relation 661. Up to 292 conditions per place. [2024-11-10 18:26:31,542 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 22 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2024-11-10 18:26:31,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 122 flow [2024-11-10 18:26:31,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:26:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:26:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2024-11-10 18:26:31,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-10 18:26:31,557 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 94 flow. Second operand 2 states and 54 transitions. [2024-11-10 18:26:31,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 122 flow [2024-11-10 18:26:31,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:31,563 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 70 flow [2024-11-10 18:26:31,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2024-11-10 18:26:31,571 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2024-11-10 18:26:31,571 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 70 flow [2024-11-10 18:26:31,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:31,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:31,572 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:31,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:26:31,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:31,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1524483756, now seen corresponding path program 1 times [2024-11-10 18:26:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953093430] [2024-11-10 18:26:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:31,795 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-10 18:26:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:31,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953093430] [2024-11-10 18:26:31,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953093430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:31,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:31,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:26:31,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078013798] [2024-11-10 18:26:31,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:31,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:26:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:26:31,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:26:31,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:31,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-10 18:26:31,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:31,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:31,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:32,125 INFO L124 PetriNetUnfolderBase]: 325/738 cut-off events. [2024-11-10 18:26:32,125 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 18:26:32,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 738 events. 325/738 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4050 event pairs, 83 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 1304. Up to 253 conditions per place. [2024-11-10 18:26:32,137 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 62 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-11-10 18:26:32,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 80 transitions, 309 flow [2024-11-10 18:26:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:26:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:26:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-11-10 18:26:32,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5064935064935064 [2024-11-10 18:26:32,140 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 70 flow. Second operand 7 states and 156 transitions. [2024-11-10 18:26:32,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 80 transitions, 309 flow [2024-11-10 18:26:32,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 80 transitions, 309 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:26:32,146 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 119 flow [2024-11-10 18:26:32,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-11-10 18:26:32,148 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-11-10 18:26:32,148 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 119 flow [2024-11-10 18:26:32,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-10 18:26:32,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:32,150 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:32,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:26:32,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:32,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:32,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1214187119, now seen corresponding path program 1 times [2024-11-10 18:26:32,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:32,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942192191] [2024-11-10 18:26:32,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:32,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:32,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942192191] [2024-11-10 18:26:32,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942192191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:32,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744528899] [2024-11-10 18:26:32,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:32,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:32,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:32,391 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-10 18:26:32,394 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-10 18:26:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:32,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 18:26:32,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:32,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:32,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744528899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:32,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:26:32,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-10 18:26:32,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146760302] [2024-11-10 18:26:32,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:32,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:26:32,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:32,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:26:32,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:26:32,669 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:32,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 119 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 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-10 18:26:32,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:32,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:32,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:33,096 INFO L124 PetriNetUnfolderBase]: 569/1226 cut-off events. [2024-11-10 18:26:33,097 INFO L125 PetriNetUnfolderBase]: For 344/384 co-relation queries the response was YES. [2024-11-10 18:26:33,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 1226 events. 569/1226 cut-off events. For 344/384 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7489 event pairs, 56 based on Foata normal form. 4/1185 useless extension candidates. Maximal degree in co-relation 2608. Up to 403 conditions per place. [2024-11-10 18:26:33,107 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 84 selfloop transitions, 14 changer transitions 0/108 dead transitions. [2024-11-10 18:26:33,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 108 transitions, 485 flow [2024-11-10 18:26:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:26:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:26:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2024-11-10 18:26:33,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5126262626262627 [2024-11-10 18:26:33,110 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 119 flow. Second operand 9 states and 203 transitions. [2024-11-10 18:26:33,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 108 transitions, 485 flow [2024-11-10 18:26:33,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 108 transitions, 475 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:26:33,117 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 178 flow [2024-11-10 18:26:33,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-11-10 18:26:33,118 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-11-10 18:26:33,118 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 178 flow [2024-11-10 18:26:33,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 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-10 18:26:33,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:33,119 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:33,142 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-10 18:26:33,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:33,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:33,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2035411141, now seen corresponding path program 1 times [2024-11-10 18:26:33,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:33,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037506511] [2024-11-10 18:26:33,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:33,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:33,408 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-10 18:26:33,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:33,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037506511] [2024-11-10 18:26:33,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037506511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:33,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:33,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:26:33,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38168490] [2024-11-10 18:26:33,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:33,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:26:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:26:33,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:26:33,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:33,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:33,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:33,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:33,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:33,676 INFO L124 PetriNetUnfolderBase]: 632/1441 cut-off events. [2024-11-10 18:26:33,677 INFO L125 PetriNetUnfolderBase]: For 1321/1448 co-relation queries the response was YES. [2024-11-10 18:26:33,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3419 conditions, 1441 events. 632/1441 cut-off events. For 1321/1448 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9540 event pairs, 200 based on Foata normal form. 6/1367 useless extension candidates. Maximal degree in co-relation 3410. Up to 504 conditions per place. [2024-11-10 18:26:33,689 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 83 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2024-11-10 18:26:33,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 105 transitions, 653 flow [2024-11-10 18:26:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:26:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:26:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2024-11-10 18:26:33,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4967532467532468 [2024-11-10 18:26:33,691 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 178 flow. Second operand 7 states and 153 transitions. [2024-11-10 18:26:33,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 105 transitions, 653 flow [2024-11-10 18:26:33,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 105 transitions, 647 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:26:33,698 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 234 flow [2024-11-10 18:26:33,698 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-11-10 18:26:33,699 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-11-10 18:26:33,700 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 234 flow [2024-11-10 18:26:33,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:33,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:33,701 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:33,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:26:33,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:33,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash -760602882, now seen corresponding path program 1 times [2024-11-10 18:26:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:33,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460857496] [2024-11-10 18:26:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:33,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:33,823 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-10 18:26:33,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:33,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460857496] [2024-11-10 18:26:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460857496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:33,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:26:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143714382] [2024-11-10 18:26:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:33,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:26:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:33,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:26:33,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:26:33,833 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:33,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10 18:26:33,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:33,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:33,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:34,103 INFO L124 PetriNetUnfolderBase]: 583/1333 cut-off events. [2024-11-10 18:26:34,103 INFO L125 PetriNetUnfolderBase]: For 1716/1746 co-relation queries the response was YES. [2024-11-10 18:26:34,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3662 conditions, 1333 events. 583/1333 cut-off events. For 1716/1746 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8449 event pairs, 124 based on Foata normal form. 12/1334 useless extension candidates. Maximal degree in co-relation 3650. Up to 439 conditions per place. [2024-11-10 18:26:34,117 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 66 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2024-11-10 18:26:34,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 554 flow [2024-11-10 18:26:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:26:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:26:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-11-10 18:26:34,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-11-10 18:26:34,120 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 234 flow. Second operand 6 states and 130 transitions. [2024-11-10 18:26:34,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 554 flow [2024-11-10 18:26:34,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 545 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:26:34,135 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 239 flow [2024-11-10 18:26:34,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-11-10 18:26:34,138 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2024-11-10 18:26:34,138 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 239 flow [2024-11-10 18:26:34,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10 18:26:34,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:34,138 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:34,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:26:34,139 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:34,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash -127774092, now seen corresponding path program 1 times [2024-11-10 18:26:34,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:34,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514075378] [2024-11-10 18:26:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:34,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:34,227 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-10 18:26:34,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:34,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514075378] [2024-11-10 18:26:34,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514075378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:34,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:34,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:26:34,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616976658] [2024-11-10 18:26:34,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:34,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:26:34,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:34,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:26:34,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:26:34,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:34,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10 18:26:34,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:34,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:34,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:34,479 INFO L124 PetriNetUnfolderBase]: 591/1340 cut-off events. [2024-11-10 18:26:34,479 INFO L125 PetriNetUnfolderBase]: For 2020/2088 co-relation queries the response was YES. [2024-11-10 18:26:34,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3866 conditions, 1340 events. 591/1340 cut-off events. For 2020/2088 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8567 event pairs, 20 based on Foata normal form. 8/1302 useless extension candidates. Maximal degree in co-relation 3853. Up to 481 conditions per place. [2024-11-10 18:26:34,489 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 71 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2024-11-10 18:26:34,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 597 flow [2024-11-10 18:26:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:26:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:26:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-11-10 18:26:34,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-11-10 18:26:34,491 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 239 flow. Second operand 6 states and 134 transitions. [2024-11-10 18:26:34,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 597 flow [2024-11-10 18:26:34,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 570 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:34,500 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 249 flow [2024-11-10 18:26:34,500 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2024-11-10 18:26:34,502 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-11-10 18:26:34,503 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 249 flow [2024-11-10 18:26:34,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10 18:26:34,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:34,504 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:34,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:26:34,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:34,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash -628137614, now seen corresponding path program 2 times [2024-11-10 18:26:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:34,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147052811] [2024-11-10 18:26:34,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:34,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:34,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:34,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147052811] [2024-11-10 18:26:34,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147052811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:34,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451052760] [2024-11-10 18:26:34,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:26:34,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:34,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:34,604 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-10 18:26:34,606 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-10 18:26:34,666 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:26:34,666 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:26:34,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:26:34,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:34,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:34,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451052760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:34,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:26:34,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-10 18:26:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758668605] [2024-11-10 18:26:34,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:34,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:26:34,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:34,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:26:34,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:26:34,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-10 18:26:34,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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-10 18:26:34,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:34,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-10 18:26:34,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:35,000 INFO L124 PetriNetUnfolderBase]: 427/1053 cut-off events. [2024-11-10 18:26:35,000 INFO L125 PetriNetUnfolderBase]: For 1760/1875 co-relation queries the response was YES. [2024-11-10 18:26:35,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 1053 events. 427/1053 cut-off events. For 1760/1875 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6648 event pairs, 91 based on Foata normal form. 42/1085 useless extension candidates. Maximal degree in co-relation 2991. Up to 332 conditions per place. [2024-11-10 18:26:35,010 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 89 selfloop transitions, 13 changer transitions 0/114 dead transitions. [2024-11-10 18:26:35,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 114 transitions, 711 flow [2024-11-10 18:26:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:26:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:26:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 218 transitions. [2024-11-10 18:26:35,012 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4954545454545455 [2024-11-10 18:26:35,012 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 249 flow. Second operand 10 states and 218 transitions. [2024-11-10 18:26:35,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 114 transitions, 711 flow [2024-11-10 18:26:35,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 114 transitions, 681 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-10 18:26:35,020 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 288 flow [2024-11-10 18:26:35,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=288, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2024-11-10 18:26:35,021 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2024-11-10 18:26:35,021 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 288 flow [2024-11-10 18:26:35,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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-10 18:26:35,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:35,022 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:35,042 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-10 18:26:35,222 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,SelfDestructingSolverStorable6 [2024-11-10 18:26:35,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:35,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1705834424, now seen corresponding path program 1 times [2024-11-10 18:26:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:35,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301584332] [2024-11-10 18:26:35,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:35,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:35,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301584332] [2024-11-10 18:26:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301584332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:35,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049074239] [2024-11-10 18:26:35,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:35,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:35,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:35,312 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-10 18:26:35,313 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-10 18:26:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:35,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:26:35,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:35,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:35,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049074239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:35,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:26:35,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-10 18:26:35,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956183437] [2024-11-10 18:26:35,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:35,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:26:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:35,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:26:35,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:26:35,508 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:35,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 288 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:35,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:35,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:35,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:35,792 INFO L124 PetriNetUnfolderBase]: 547/1290 cut-off events. [2024-11-10 18:26:35,792 INFO L125 PetriNetUnfolderBase]: For 2623/2684 co-relation queries the response was YES. [2024-11-10 18:26:35,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3829 conditions, 1290 events. 547/1290 cut-off events. For 2623/2684 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8326 event pairs, 162 based on Foata normal form. 0/1232 useless extension candidates. Maximal degree in co-relation 3813. Up to 483 conditions per place. [2024-11-10 18:26:35,804 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 86 selfloop transitions, 15 changer transitions 0/112 dead transitions. [2024-11-10 18:26:35,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 839 flow [2024-11-10 18:26:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:26:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:26:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-11-10 18:26:35,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4823232323232323 [2024-11-10 18:26:35,806 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 288 flow. Second operand 9 states and 191 transitions. [2024-11-10 18:26:35,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 839 flow [2024-11-10 18:26:35,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 112 transitions, 819 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-10 18:26:35,815 INFO L231 Difference]: Finished difference. Result has 77 places, 55 transitions, 346 flow [2024-11-10 18:26:35,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=346, PETRI_PLACES=77, PETRI_TRANSITIONS=55} [2024-11-10 18:26:35,816 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2024-11-10 18:26:35,816 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 346 flow [2024-11-10 18:26:35,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:35,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:35,817 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:35,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 18:26:36,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:36,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:36,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1762672073, now seen corresponding path program 1 times [2024-11-10 18:26:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:36,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486294238] [2024-11-10 18:26:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:36,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:26:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:36,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:26:36,059 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:26:36,060 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 18:26:36,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 18:26:36,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-10 18:26:36,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 18:26:36,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-10 18:26:36,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-10 18:26:36,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 18:26:36,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:26:36,064 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:36,094 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:26:36,094 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:26:36,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:26:36 BasicIcfg [2024-11-10 18:26:36,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:26:36,100 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:26:36,100 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:26:36,100 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:26:36,100 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:30" (3/4) ... [2024-11-10 18:26:36,102 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:26:36,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:26:36,104 INFO L158 Benchmark]: Toolchain (without parser) took 6380.87ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 127.3MB in the beginning and 88.4MB in the end (delta: 38.9MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2024-11-10 18:26:36,104 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 100.7MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:36,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.32ms. Allocated memory is still 165.7MB. Free memory was 127.3MB in the beginning and 104.2MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 18:26:36,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.74ms. Allocated memory is still 165.7MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:36,105 INFO L158 Benchmark]: Boogie Preprocessor took 58.47ms. Allocated memory is still 165.7MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:36,106 INFO L158 Benchmark]: IcfgBuilder took 543.00ms. Allocated memory is still 165.7MB. Free memory was 100.0MB in the beginning and 117.7MB in the end (delta: -17.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 18:26:36,106 INFO L158 Benchmark]: TraceAbstraction took 5179.90ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 117.7MB in the beginning and 89.4MB in the end (delta: 28.3MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-11-10 18:26:36,106 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 199.2MB. Free memory was 89.4MB in the beginning and 88.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:36,108 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.12ms. Allocated memory is still 100.7MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.32ms. Allocated memory is still 165.7MB. Free memory was 127.3MB in the beginning and 104.2MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.74ms. Allocated memory is still 165.7MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.47ms. Allocated memory is still 165.7MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 543.00ms. Allocated memory is still 165.7MB. Free memory was 100.0MB in the beginning and 117.7MB in the end (delta: -17.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5179.90ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 117.7MB in the beginning and 89.4MB in the end (delta: 28.3MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 199.2MB. Free memory was 89.4MB in the beginning and 88.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=0] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=0, t2=1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [_N=1, limit=1] [L752] 2 __assert_fail ("0", "generated/unwind2.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=1, limit=1] - UnprovableResult [Line: 774]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 778]: 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: 779]: 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: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 65 locations, 7 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: 5.0s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 713 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1373 IncrementalHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 16 mSDtfsCounter, 1373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=8, InterpolantAutomatonStates: 56, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 510 SizeOfPredicates, 12 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 10/24 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-10 18:26:36,145 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-theta/unwind2-1.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 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:26:38,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:26:38,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:26:38,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:26:38,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:26:38,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:26:38,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:26:38,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:26:38,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:26:38,632 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:26:38,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:26:38,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:26:38,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:26:38,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:26:38,634 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:26:38,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:26:38,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:26:38,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:26:38,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:26:38,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:26:38,638 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:26:38,639 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:26:38,639 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:26:38,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:26:38,640 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:26:38,640 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:26:38,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:26:38,641 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:26:38,641 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:26:38,641 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:26:38,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:26:38,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:26:38,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:26:38,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:26:38,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:26:38,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:38,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:26:38,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:26:38,647 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:26:38,647 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:26:38,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:26:38,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:26:38,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:26:38,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:26:38,650 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 -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2024-11-10 18:26:39,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:26:39,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:26:39,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:26:39,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:26:39,036 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:26:39,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-10 18:26:40,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:26:41,056 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:26:41,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-10 18:26:41,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abe04f6e/bea788957742482180a0c1f9ed51965c/FLAG1dc73e941 [2024-11-10 18:26:41,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abe04f6e/bea788957742482180a0c1f9ed51965c [2024-11-10 18:26:41,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:26:41,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:26:41,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:41,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:26:41,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:26:41,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a491957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41, skipping insertion in model container [2024-11-10 18:26:41,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:26:41,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:41,595 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:26:41,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:41,683 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:26:41,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41 WrapperNode [2024-11-10 18:26:41,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:41,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:41,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:26:41,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:26:41,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,734 INFO L138 Inliner]: procedures = 170, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 84 [2024-11-10 18:26:41,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:41,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:26:41,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:26:41,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:26:41,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,784 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-10 18:26:41,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,800 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:26:41,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:26:41,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:26:41,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:26:41,817 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (1/1) ... [2024-11-10 18:26:41,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:41,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:41,856 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-10 18:26:41,862 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-10 18:26:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:26:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-10 18:26:41,911 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-10 18:26:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-10 18:26:41,913 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-10 18:26:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:26:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:26:41,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:26:41,914 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:26:42,087 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:26:42,092 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:26:42,310 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:26:42,310 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:26:42,494 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:26:42,494 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:26:42,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:42 BoogieIcfgContainer [2024-11-10 18:26:42,495 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:26:42,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:26:42,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:26:42,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:26:42,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:26:41" (1/3) ... [2024-11-10 18:26:42,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65555f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:42, skipping insertion in model container [2024-11-10 18:26:42,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:41" (2/3) ... [2024-11-10 18:26:42,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65555f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:42, skipping insertion in model container [2024-11-10 18:26:42,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:42" (3/3) ... [2024-11-10 18:26:42,505 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2024-11-10 18:26:42,523 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:26:42,523 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 18:26:42,523 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:26:42,587 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 18:26:42,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 44 transitions, 102 flow [2024-11-10 18:26:42,663 INFO L124 PetriNetUnfolderBase]: 8/42 cut-off events. [2024-11-10 18:26:42,663 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:26:42,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 42 events. 8/42 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-10 18:26:42,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 44 transitions, 102 flow [2024-11-10 18:26:42,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 41 transitions, 94 flow [2024-11-10 18:26:42,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:26:42,705 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;@6734a898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:26:42,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 18:26:42,720 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:26:42,720 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-11-10 18:26:42,721 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 18:26:42,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:42,722 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:42,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:42,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:42,729 INFO L85 PathProgramCache]: Analyzing trace with hash -716188965, now seen corresponding path program 1 times [2024-11-10 18:26:42,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:42,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882266185] [2024-11-10 18:26:42,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:42,745 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-10 18:26:42,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:42,749 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-10 18:26:42,750 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-10 18:26:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:42,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 18:26:42,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:42,870 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-10 18:26:42,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:42,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:42,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882266185] [2024-11-10 18:26:42,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882266185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:42,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:42,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:26:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498906815] [2024-11-10 18:26:42,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:42,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:26:42,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:42,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:26:42,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:26:42,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-10 18:26:42,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:42,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:42,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-10 18:26:42,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:43,082 INFO L124 PetriNetUnfolderBase]: 169/393 cut-off events. [2024-11-10 18:26:43,082 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-10 18:26:43,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 393 events. 169/393 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1787 event pairs, 138 based on Foata normal form. 93/473 useless extension candidates. Maximal degree in co-relation 661. Up to 292 conditions per place. [2024-11-10 18:26:43,091 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 22 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2024-11-10 18:26:43,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 122 flow [2024-11-10 18:26:43,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:26:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:26:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2024-11-10 18:26:43,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-10 18:26:43,104 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 94 flow. Second operand 2 states and 54 transitions. [2024-11-10 18:26:43,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 122 flow [2024-11-10 18:26:43,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:43,108 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 70 flow [2024-11-10 18:26:43,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2024-11-10 18:26:43,114 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2024-11-10 18:26:43,114 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 70 flow [2024-11-10 18:26:43,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:43,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:43,115 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:43,120 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-10 18:26:43,316 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-10 18:26:43,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:43,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash -757559954, now seen corresponding path program 1 times [2024-11-10 18:26:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:43,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781918980] [2024-11-10 18:26:43,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:43,319 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-10 18:26:43,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:43,322 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-10 18:26:43,324 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-10 18:26:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:43,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:26:43,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:43,479 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-10 18:26:43,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:43,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:43,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781918980] [2024-11-10 18:26:43,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781918980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:43,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:43,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:26:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156177615] [2024-11-10 18:26:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:43,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:26:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:43,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:26:43,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:26:43,492 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:43,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-10 18:26:43,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:43,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:43,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:43,824 INFO L124 PetriNetUnfolderBase]: 325/726 cut-off events. [2024-11-10 18:26:43,825 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 18:26:43,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 726 events. 325/726 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3963 event pairs, 50 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 1292. Up to 253 conditions per place. [2024-11-10 18:26:43,836 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 62 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-11-10 18:26:43,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 80 transitions, 309 flow [2024-11-10 18:26:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:26:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:26:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-11-10 18:26:43,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5064935064935064 [2024-11-10 18:26:43,842 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 70 flow. Second operand 7 states and 156 transitions. [2024-11-10 18:26:43,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 80 transitions, 309 flow [2024-11-10 18:26:43,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 80 transitions, 309 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:26:43,846 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 119 flow [2024-11-10 18:26:43,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-11-10 18:26:43,847 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-11-10 18:26:43,847 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 119 flow [2024-11-10 18:26:43,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-10 18:26:43,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:43,848 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:43,853 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-10 18:26:44,052 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-10 18:26:44,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:44,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:44,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1396497167, now seen corresponding path program 1 times [2024-11-10 18:26:44,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:44,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889280450] [2024-11-10 18:26:44,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:44,054 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-10 18:26:44,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:44,057 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-10 18:26:44,059 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-10 18:26:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:44,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:26:44,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:44,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:44,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889280450] [2024-11-10 18:26:44,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889280450] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:44,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:26:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-10 18:26:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936409807] [2024-11-10 18:26:44,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:44,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:26:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:44,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:26:44,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:26:44,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:44,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 119 flow. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:44,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:44,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:44,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:44,850 INFO L124 PetriNetUnfolderBase]: 569/1240 cut-off events. [2024-11-10 18:26:44,850 INFO L125 PetriNetUnfolderBase]: For 366/406 co-relation queries the response was YES. [2024-11-10 18:26:44,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 1240 events. 569/1240 cut-off events. For 366/406 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7661 event pairs, 89 based on Foata normal form. 4/1195 useless extension candidates. Maximal degree in co-relation 2618. Up to 403 conditions per place. [2024-11-10 18:26:44,863 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 84 selfloop transitions, 14 changer transitions 0/108 dead transitions. [2024-11-10 18:26:44,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 108 transitions, 485 flow [2024-11-10 18:26:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:26:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:26:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2024-11-10 18:26:44,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5126262626262627 [2024-11-10 18:26:44,869 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 119 flow. Second operand 9 states and 203 transitions. [2024-11-10 18:26:44,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 108 transitions, 485 flow [2024-11-10 18:26:44,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 108 transitions, 475 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:26:44,879 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 178 flow [2024-11-10 18:26:44,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-11-10 18:26:44,880 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-11-10 18:26:44,881 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 178 flow [2024-11-10 18:26:44,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:44,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:44,882 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:44,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 18:26:45,082 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-10 18:26:45,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:45,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:45,084 INFO L85 PathProgramCache]: Analyzing trace with hash -575273145, now seen corresponding path program 1 times [2024-11-10 18:26:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:45,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351229298] [2024-11-10 18:26:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:45,085 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-10 18:26:45,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:45,087 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-10 18:26:45,088 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-10 18:26:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:45,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:26:45,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:45,198 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-10 18:26:45,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:45,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:45,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351229298] [2024-11-10 18:26:45,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351229298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:45,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:45,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:26:45,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492048006] [2024-11-10 18:26:45,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:45,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:26:45,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:45,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:26:45,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:26:45,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:45,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:45,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:45,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:45,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:45,490 INFO L124 PetriNetUnfolderBase]: 632/1423 cut-off events. [2024-11-10 18:26:45,492 INFO L125 PetriNetUnfolderBase]: For 1352/1479 co-relation queries the response was YES. [2024-11-10 18:26:45,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3397 conditions, 1423 events. 632/1423 cut-off events. For 1352/1479 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9322 event pairs, 170 based on Foata normal form. 6/1353 useless extension candidates. Maximal degree in co-relation 3388. Up to 504 conditions per place. [2024-11-10 18:26:45,502 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 83 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2024-11-10 18:26:45,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 105 transitions, 653 flow [2024-11-10 18:26:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:26:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:26:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2024-11-10 18:26:45,505 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4967532467532468 [2024-11-10 18:26:45,505 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 178 flow. Second operand 7 states and 153 transitions. [2024-11-10 18:26:45,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 105 transitions, 653 flow [2024-11-10 18:26:45,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 105 transitions, 647 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:26:45,512 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 234 flow [2024-11-10 18:26:45,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-11-10 18:26:45,514 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-11-10 18:26:45,514 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 234 flow [2024-11-10 18:26:45,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:45,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:45,515 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:45,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 18:26:45,718 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-10 18:26:45,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:45,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:45,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1367300800, now seen corresponding path program 1 times [2024-11-10 18:26:45,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:45,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049553368] [2024-11-10 18:26:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:45,722 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-10 18:26:45,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:45,723 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-10 18:26:45,724 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-10 18:26:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:45,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:26:45,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:45,827 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-10 18:26:45,827 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:45,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049553368] [2024-11-10 18:26:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049553368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:45,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:45,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:26:45,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248157277] [2024-11-10 18:26:45,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:45,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:26:45,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:45,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:26:45,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:26:45,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:45,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10 18:26:45,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:45,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:45,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:46,094 INFO L124 PetriNetUnfolderBase]: 583/1333 cut-off events. [2024-11-10 18:26:46,094 INFO L125 PetriNetUnfolderBase]: For 1738/1776 co-relation queries the response was YES. [2024-11-10 18:26:46,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3662 conditions, 1333 events. 583/1333 cut-off events. For 1738/1776 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8460 event pairs, 124 based on Foata normal form. 12/1334 useless extension candidates. Maximal degree in co-relation 3650. Up to 439 conditions per place. [2024-11-10 18:26:46,103 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 66 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2024-11-10 18:26:46,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 554 flow [2024-11-10 18:26:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:26:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:26:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-11-10 18:26:46,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-11-10 18:26:46,105 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 234 flow. Second operand 6 states and 130 transitions. [2024-11-10 18:26:46,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 554 flow [2024-11-10 18:26:46,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 545 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:26:46,112 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 239 flow [2024-11-10 18:26:46,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-11-10 18:26:46,113 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2024-11-10 18:26:46,113 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 239 flow [2024-11-10 18:26:46,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10 18:26:46,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:46,113 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:46,118 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-10 18:26:46,314 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-10 18:26:46,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:46,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash -734472010, now seen corresponding path program 1 times [2024-11-10 18:26:46,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:46,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127759970] [2024-11-10 18:26:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:46,316 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-10 18:26:46,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:46,319 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-10 18:26:46,320 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-10 18:26:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:46,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:26:46,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:46,422 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-10 18:26:46,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:46,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:46,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127759970] [2024-11-10 18:26:46,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127759970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:46,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:26:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292394252] [2024-11-10 18:26:46,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:46,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:26:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:26:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:26:46,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:46,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10 18:26:46,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:46,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:46,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:46,681 INFO L124 PetriNetUnfolderBase]: 591/1340 cut-off events. [2024-11-10 18:26:46,682 INFO L125 PetriNetUnfolderBase]: For 2040/2108 co-relation queries the response was YES. [2024-11-10 18:26:46,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3866 conditions, 1340 events. 591/1340 cut-off events. For 2040/2108 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8545 event pairs, 20 based on Foata normal form. 8/1302 useless extension candidates. Maximal degree in co-relation 3853. Up to 481 conditions per place. [2024-11-10 18:26:46,692 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 71 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2024-11-10 18:26:46,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 597 flow [2024-11-10 18:26:46,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:26:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:26:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-11-10 18:26:46,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-11-10 18:26:46,694 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 239 flow. Second operand 6 states and 134 transitions. [2024-11-10 18:26:46,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 597 flow [2024-11-10 18:26:46,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 570 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:46,704 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 249 flow [2024-11-10 18:26:46,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2024-11-10 18:26:46,705 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-11-10 18:26:46,705 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 249 flow [2024-11-10 18:26:46,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10 18:26:46,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:46,706 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:46,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 18:26:46,906 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-10 18:26:46,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:46,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:46,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1234835532, now seen corresponding path program 2 times [2024-11-10 18:26:46,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398221163] [2024-11-10 18:26:46,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:26:46,908 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-10 18:26:46,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:46,912 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-10 18:26:46,913 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-10 18:26:46,956 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:26:46,957 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:26:46,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:26:46,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:47,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:47,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:47,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398221163] [2024-11-10 18:26:47,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398221163] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:47,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:26:47,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-10 18:26:47,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908147224] [2024-11-10 18:26:47,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:47,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:26:47,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:47,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:26:47,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:26:47,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:47,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 249 flow. Second operand has 12 states, 12 states have (on average 13.416666666666666) internal successors, (161), 12 states have internal predecessors, (161), 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-10 18:26:47,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:47,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:47,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:47,652 INFO L124 PetriNetUnfolderBase]: 510/1152 cut-off events. [2024-11-10 18:26:47,652 INFO L125 PetriNetUnfolderBase]: For 2103/2264 co-relation queries the response was YES. [2024-11-10 18:26:47,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 1152 events. 510/1152 cut-off events. For 2103/2264 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7036 event pairs, 31 based on Foata normal form. 38/1186 useless extension candidates. Maximal degree in co-relation 3358. Up to 238 conditions per place. [2024-11-10 18:26:47,661 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 101 selfloop transitions, 15 changer transitions 0/127 dead transitions. [2024-11-10 18:26:47,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 127 transitions, 792 flow [2024-11-10 18:26:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 18:26:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 18:26:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 246 transitions. [2024-11-10 18:26:47,663 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2024-11-10 18:26:47,663 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 249 flow. Second operand 12 states and 246 transitions. [2024-11-10 18:26:47,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 127 transitions, 792 flow [2024-11-10 18:26:47,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 127 transitions, 762 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-10 18:26:47,670 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 308 flow [2024-11-10 18:26:47,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=308, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2024-11-10 18:26:47,671 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2024-11-10 18:26:47,671 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 308 flow [2024-11-10 18:26:47,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.416666666666666) internal successors, (161), 12 states have internal predecessors, (161), 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-10 18:26:47,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:47,672 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:47,679 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 (8)] Forceful destruction successful, exit code 0 [2024-11-10 18:26:47,875 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-10 18:26:47,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:47,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1982434954, now seen corresponding path program 1 times [2024-11-10 18:26:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57289131] [2024-11-10 18:26:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:47,876 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-10 18:26:47,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:47,879 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-10 18:26:47,880 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-10 18:26:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:47,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:26:47,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:47,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:48,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:48,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57289131] [2024-11-10 18:26:48,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57289131] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:48,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:26:48,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-10 18:26:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434540812] [2024-11-10 18:26:48,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:48,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:26:48,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:48,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:26:48,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:26:48,091 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-10 18:26:48,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 308 flow. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 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-10 18:26:48,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:48,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-10 18:26:48,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:48,505 INFO L124 PetriNetUnfolderBase]: 547/1285 cut-off events. [2024-11-10 18:26:48,506 INFO L125 PetriNetUnfolderBase]: For 2770/2830 co-relation queries the response was YES. [2024-11-10 18:26:48,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3881 conditions, 1285 events. 547/1285 cut-off events. For 2770/2830 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8220 event pairs, 147 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 3864. Up to 483 conditions per place. [2024-11-10 18:26:48,519 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 86 selfloop transitions, 15 changer transitions 0/113 dead transitions. [2024-11-10 18:26:48,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 113 transitions, 864 flow [2024-11-10 18:26:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:26:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:26:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2024-11-10 18:26:48,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4823232323232323 [2024-11-10 18:26:48,522 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 308 flow. Second operand 9 states and 191 transitions. [2024-11-10 18:26:48,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 113 transitions, 864 flow [2024-11-10 18:26:48,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 113 transitions, 793 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-11-10 18:26:48,529 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 334 flow [2024-11-10 18:26:48,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=334, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2024-11-10 18:26:48,530 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2024-11-10 18:26:48,530 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 334 flow [2024-11-10 18:26:48,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 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-10 18:26:48,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:48,530 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:48,535 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-10 18:26:48,734 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-10 18:26:48,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:48,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:48,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2003645329, now seen corresponding path program 1 times [2024-11-10 18:26:48,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:48,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151330000] [2024-11-10 18:26:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:48,736 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-10 18:26:48,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:48,740 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-10 18:26:48,741 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-10 18:26:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:48,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:26:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:48,834 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 18:26:48,834 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:26:48,835 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 18:26:48,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 18:26:48,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-10 18:26:48,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 18:26:48,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-10 18:26:48,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-10 18:26:48,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 18:26:48,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 18:26:49,041 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-10 18:26:49,042 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:49,083 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:26:49,083 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:26:49,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:26:49 BasicIcfg [2024-11-10 18:26:49,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:26:49,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:26:49,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:26:49,088 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:26:49,088 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:42" (3/4) ... [2024-11-10 18:26:49,090 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:26:49,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:26:49,092 INFO L158 Benchmark]: Toolchain (without parser) took 7984.31ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 38.0MB in the beginning and 71.7MB in the end (delta: -33.6MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-11-10 18:26:49,092 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 54.5MB. Free memory is still 37.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:49,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.75ms. Allocated memory is still 69.2MB. Free memory was 37.7MB in the beginning and 31.9MB in the end (delta: 5.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-10 18:26:49,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.53ms. Allocated memory is still 69.2MB. Free memory was 31.9MB in the beginning and 29.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:49,093 INFO L158 Benchmark]: Boogie Preprocessor took 79.69ms. Allocated memory is still 69.2MB. Free memory was 29.6MB in the beginning and 46.8MB in the end (delta: -17.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:26:49,093 INFO L158 Benchmark]: IcfgBuilder took 678.94ms. Allocated memory is still 69.2MB. Free memory was 46.8MB in the beginning and 38.4MB in the end (delta: 8.4MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-10 18:26:49,094 INFO L158 Benchmark]: TraceAbstraction took 6588.74ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 37.7MB in the beginning and 71.7MB in the end (delta: -34.0MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-10 18:26:49,094 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 121.6MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:49,096 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.13ms. Allocated memory is still 54.5MB. Free memory is still 37.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.75ms. Allocated memory is still 69.2MB. Free memory was 37.7MB in the beginning and 31.9MB in the end (delta: 5.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.53ms. Allocated memory is still 69.2MB. Free memory was 31.9MB in the beginning and 29.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.69ms. Allocated memory is still 69.2MB. Free memory was 29.6MB in the beginning and 46.8MB in the end (delta: -17.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 678.94ms. Allocated memory is still 69.2MB. Free memory was 46.8MB in the beginning and 38.4MB in the end (delta: 8.4MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6588.74ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 37.7MB in the beginning and 71.7MB in the end (delta: -34.0MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 121.6MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=0] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=0, t2=1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [_N=1, limit=1] [L752] 2 __assert_fail ("0", "generated/unwind2.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=1, limit=1] - UnprovableResult [Line: 774]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 778]: 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: 779]: 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: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 65 locations, 7 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: 6.4s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 809 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 804 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1578 IncrementalHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 13 mSDtfsCounter, 1578 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=8, InterpolantAutomatonStates: 58, 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, 0.7s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 432 SizeOfPredicates, 22 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 8/20 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-10 18:26:49,124 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