./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-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/unwind3-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 ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:26:34,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:26:34,939 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:34,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:26:34,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:26:34,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:26:34,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:26:34,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:26:34,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:26:34,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:26:34,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:26:34,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:26:34,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:26:34,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:26:34,962 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:26:34,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:26:34,963 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:26:34,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:26:34,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:26:34,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:26:34,964 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:26:34,967 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:26:34,967 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:26:34,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:26:34,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:26:34,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:26:34,968 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:26:34,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:26:34,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:26:34,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:26:34,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:26:34,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:26:34,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:26:34,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:34,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:26:34,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:26:34,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:26:34,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:26:34,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:26:34,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:26:34,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:26:34,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:26:34,972 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 -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2024-11-10 18:26:35,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:26:35,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:26:35,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:26:35,232 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:26:35,233 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:26:35,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-10 18:26:36,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:26:37,107 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:26:37,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-10 18:26:37,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a8dcfa7/cb24867b4c544e89b652634723901c1c/FLAG980962e03 [2024-11-10 18:26:37,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a8dcfa7/cb24867b4c544e89b652634723901c1c [2024-11-10 18:26:37,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:26:37,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:26:37,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:37,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:26:37,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:26:37,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:37" (1/1) ... [2024-11-10 18:26:37,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13053b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:37, skipping insertion in model container [2024-11-10 18:26:37,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:37" (1/1) ... [2024-11-10 18:26:37,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:26:37,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:37,551 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:26:37,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:37,642 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:26:37,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:37 WrapperNode [2024-11-10 18:26:37,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:37,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:37,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:26:37,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:26:37,650 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:37" (1/1) ... [2024-11-10 18:26:37,666 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:37" (1/1) ... [2024-11-10 18:26:37,689 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 64 [2024-11-10 18:26:37,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:37,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:26:37,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:26:37,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:26:37,700 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:37" (1/1) ... [2024-11-10 18:26:37,700 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:37" (1/1) ... [2024-11-10 18:26:37,702 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:37" (1/1) ... [2024-11-10 18:26:37,713 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:37,713 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:37" (1/1) ... [2024-11-10 18:26:37,713 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:37" (1/1) ... [2024-11-10 18:26:37,717 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:37" (1/1) ... [2024-11-10 18:26:37,718 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:37" (1/1) ... [2024-11-10 18:26:37,719 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:37" (1/1) ... [2024-11-10 18:26:37,720 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:37" (1/1) ... [2024-11-10 18:26:37,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:26:37,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:26:37,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:26:37,722 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:26:37,723 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:37" (1/1) ... [2024-11-10 18:26:37,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:37,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:37,752 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:37,754 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:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:26:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-10 18:26:37,789 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-10 18:26:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-10 18:26:37,789 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-10 18:26:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:26:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:26:37,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:26:37,791 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:37,896 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:26:37,898 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:26:38,000 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:26:38,000 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:26:38,073 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:26:38,073 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:26:38,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:38 BoogieIcfgContainer [2024-11-10 18:26:38,074 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:26:38,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:26:38,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:26:38,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:26:38,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:26:37" (1/3) ... [2024-11-10 18:26:38,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dabec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:38, skipping insertion in model container [2024-11-10 18:26:38,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:37" (2/3) ... [2024-11-10 18:26:38,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dabec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:38, skipping insertion in model container [2024-11-10 18:26:38,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:38" (3/3) ... [2024-11-10 18:26:38,085 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2024-11-10 18:26:38,098 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:26:38,099 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 18:26:38,099 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:26:38,133 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:26:38,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 74 flow [2024-11-10 18:26:38,195 INFO L124 PetriNetUnfolderBase]: 10/55 cut-off events. [2024-11-10 18:26:38,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:38,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 55 events. 10/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 126 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2024-11-10 18:26:38,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 74 flow [2024-11-10 18:26:38,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 32 transitions, 71 flow [2024-11-10 18:26:38,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:26:38,218 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;@2338079b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:26:38,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 18:26:38,224 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:26:38,225 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-10 18:26:38,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:38,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:38,226 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:38,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:38,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1786619418, now seen corresponding path program 1 times [2024-11-10 18:26:38,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:38,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342762877] [2024-11-10 18:26:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:38,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:38,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:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:38,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342762877] [2024-11-10 18:26:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342762877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:38,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:38,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:26:38,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876413860] [2024-11-10 18:26:38,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:38,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:26:38,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:38,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:26:38,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:26:38,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-11-10 18:26:38,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 32 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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:38,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:38,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-11-10 18:26:38,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:38,621 INFO L124 PetriNetUnfolderBase]: 109/261 cut-off events. [2024-11-10 18:26:38,621 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 18:26:38,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 261 events. 109/261 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1068 event pairs, 94 based on Foata normal form. 50/292 useless extension candidates. Maximal degree in co-relation 394. Up to 205 conditions per place. [2024-11-10 18:26:38,631 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 17 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2024-11-10 18:26:38,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 95 flow [2024-11-10 18:26:38,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:26:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:26:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2024-11-10 18:26:38,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-11-10 18:26:38,649 INFO L175 Difference]: Start difference. First operand has 33 places, 32 transitions, 71 flow. Second operand 2 states and 43 transitions. [2024-11-10 18:26:38,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 95 flow [2024-11-10 18:26:38,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:38,653 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 60 flow [2024-11-10 18:26:38,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-11-10 18:26:38,657 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2024-11-10 18:26:38,657 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 60 flow [2024-11-10 18:26:38,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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:38,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:38,658 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:38,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:26:38,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:38,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:38,659 INFO L85 PathProgramCache]: Analyzing trace with hash 437964966, now seen corresponding path program 1 times [2024-11-10 18:26:38,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:38,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225055382] [2024-11-10 18:26:38,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:38,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:38,747 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:38,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:38,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225055382] [2024-11-10 18:26:38,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225055382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:38,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:38,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:26:38,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901389512] [2024-11-10 18:26:38,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:38,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:26:38,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:38,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:26:38,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:26:38,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-11-10 18:26:38,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:38,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:38,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-11-10 18:26:38,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:38,816 INFO L124 PetriNetUnfolderBase]: 101/246 cut-off events. [2024-11-10 18:26:38,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:38,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 246 events. 101/246 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 942 event pairs, 32 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 441. Up to 179 conditions per place. [2024-11-10 18:26:38,822 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 20 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-11-10 18:26:38,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 114 flow [2024-11-10 18:26:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:26:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:26:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-11-10 18:26:38,824 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-11-10 18:26:38,824 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 60 flow. Second operand 4 states and 60 transitions. [2024-11-10 18:26:38,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 114 flow [2024-11-10 18:26:38,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:26:38,827 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 70 flow [2024-11-10 18:26:38,827 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2024-11-10 18:26:38,829 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2024-11-10 18:26:38,829 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 70 flow [2024-11-10 18:26:38,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:38,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:38,830 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:38,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:26:38,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:38,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash 757111635, now seen corresponding path program 1 times [2024-11-10 18:26:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000290402] [2024-11-10 18:26:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000290402] [2024-11-10 18:26:38,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000290402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:38,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942600353] [2024-11-10 18:26:38,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:38,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:38,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:38,945 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:38,949 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:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:39,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:26:39,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:39,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942600353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:39,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:26:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-10 18:26:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741453514] [2024-11-10 18:26:39,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:39,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:26:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:39,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:26:39,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:26:39,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:39,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:39,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:39,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:39,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:39,233 INFO L124 PetriNetUnfolderBase]: 95/232 cut-off events. [2024-11-10 18:26:39,234 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 18:26:39,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 232 events. 95/232 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 868 event pairs, 32 based on Foata normal form. 4/224 useless extension candidates. Maximal degree in co-relation 427. Up to 158 conditions per place. [2024-11-10 18:26:39,238 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 20 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-11-10 18:26:39,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 127 flow [2024-11-10 18:26:39,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:26:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:26:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2024-11-10 18:26:39,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-11-10 18:26:39,240 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 70 flow. Second operand 5 states and 75 transitions. [2024-11-10 18:26:39,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 127 flow [2024-11-10 18:26:39,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:39,241 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 72 flow [2024-11-10 18:26:39,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2024-11-10 18:26:39,242 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2024-11-10 18:26:39,242 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 72 flow [2024-11-10 18:26:39,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:39,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:39,244 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:39,259 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:39,448 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:39,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:39,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2057437922, now seen corresponding path program 1 times [2024-11-10 18:26:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926891407] [2024-11-10 18:26:39,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:39,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:39,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926891407] [2024-11-10 18:26:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926891407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:39,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:39,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:26:39,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578384110] [2024-11-10 18:26:39,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:39,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:26:39,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:39,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:26:39,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:26:39,529 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:39,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:39,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:39,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:39,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:39,564 INFO L124 PetriNetUnfolderBase]: 95/224 cut-off events. [2024-11-10 18:26:39,565 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 18:26:39,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 224 events. 95/224 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 818 event pairs, 83 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 425. Up to 170 conditions per place. [2024-11-10 18:26:39,566 INFO L140 encePairwiseOnDemand]: 31/33 looper letters, 15 selfloop transitions, 1 changer transitions 1/25 dead transitions. [2024-11-10 18:26:39,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 104 flow [2024-11-10 18:26:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:26:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:26:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-10 18:26:39,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-10 18:26:39,568 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 72 flow. Second operand 3 states and 48 transitions. [2024-11-10 18:26:39,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 104 flow [2024-11-10 18:26:39,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 96 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:39,569 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 62 flow [2024-11-10 18:26:39,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2024-11-10 18:26:39,570 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2024-11-10 18:26:39,570 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 62 flow [2024-11-10 18:26:39,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:39,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:39,571 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:39,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:26:39,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:39,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:39,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1399106078, now seen corresponding path program 1 times [2024-11-10 18:26:39,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:39,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938050900] [2024-11-10 18:26:39,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:39,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:39,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938050900] [2024-11-10 18:26:39,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938050900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:39,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:39,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:26:39,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266416170] [2024-11-10 18:26:39,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:39,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:26:39,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:26:39,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:26:39,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:39,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:39,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:39,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:39,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:39,742 INFO L124 PetriNetUnfolderBase]: 112/255 cut-off events. [2024-11-10 18:26:39,743 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 18:26:39,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 255 events. 112/255 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 947 event pairs, 45 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 475. Up to 99 conditions per place. [2024-11-10 18:26:39,745 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 29 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-11-10 18:26:39,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 177 flow [2024-11-10 18:26:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:26:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:26:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-11-10 18:26:39,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2024-11-10 18:26:39,746 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 62 flow. Second operand 6 states and 98 transitions. [2024-11-10 18:26:39,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 177 flow [2024-11-10 18:26:39,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:39,748 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 102 flow [2024-11-10 18:26:39,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-11-10 18:26:39,749 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2024-11-10 18:26:39,749 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 102 flow [2024-11-10 18:26:39,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:39,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:39,749 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:39,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:26:39,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:39,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:39,750 INFO L85 PathProgramCache]: Analyzing trace with hash -662195991, now seen corresponding path program 1 times [2024-11-10 18:26:39,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:39,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586931744] [2024-11-10 18:26:39,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:39,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:39,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:39,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586931744] [2024-11-10 18:26:39,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586931744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:39,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:39,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:26:39,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854335135] [2024-11-10 18:26:39,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:39,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:26:39,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:39,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:26:39,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:26:39,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:39,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:39,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:39,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:39,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:39,955 INFO L124 PetriNetUnfolderBase]: 133/292 cut-off events. [2024-11-10 18:26:39,955 INFO L125 PetriNetUnfolderBase]: For 124/127 co-relation queries the response was YES. [2024-11-10 18:26:39,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 292 events. 133/292 cut-off events. For 124/127 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1141 event pairs, 60 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 693. Up to 147 conditions per place. [2024-11-10 18:26:39,956 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 19 selfloop transitions, 6 changer transitions 11/43 dead transitions. [2024-11-10 18:26:39,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 211 flow [2024-11-10 18:26:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:26:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:26:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2024-11-10 18:26:39,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2024-11-10 18:26:39,958 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 102 flow. Second operand 6 states and 94 transitions. [2024-11-10 18:26:39,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 211 flow [2024-11-10 18:26:39,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:26:39,961 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 124 flow [2024-11-10 18:26:39,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2024-11-10 18:26:39,962 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2024-11-10 18:26:39,962 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 124 flow [2024-11-10 18:26:39,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:39,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:39,963 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:39,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:26:39,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:39,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash 552967141, now seen corresponding path program 1 times [2024-11-10 18:26:39,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:39,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184366484] [2024-11-10 18:26:39,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:39,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:40,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:40,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184366484] [2024-11-10 18:26:40,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184366484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:40,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748486562] [2024-11-10 18:26:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:40,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:40,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:40,039 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:40,041 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:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:40,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:26:40,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:40,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:40,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748486562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:40,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:26:40,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-10 18:26:40,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558766899] [2024-11-10 18:26:40,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:40,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:26:40,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:40,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:26:40,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:26:40,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:40,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 124 flow. Second operand has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 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:40,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:40,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:40,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:40,327 INFO L124 PetriNetUnfolderBase]: 136/319 cut-off events. [2024-11-10 18:26:40,327 INFO L125 PetriNetUnfolderBase]: For 389/392 co-relation queries the response was YES. [2024-11-10 18:26:40,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 319 events. 136/319 cut-off events. For 389/392 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1293 event pairs, 60 based on Foata normal form. 12/319 useless extension candidates. Maximal degree in co-relation 858. Up to 141 conditions per place. [2024-11-10 18:26:40,329 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 24 selfloop transitions, 7 changer transitions 6/44 dead transitions. [2024-11-10 18:26:40,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 242 flow [2024-11-10 18:26:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:26:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:26:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-11-10 18:26:40,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4797979797979798 [2024-11-10 18:26:40,330 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 124 flow. Second operand 6 states and 95 transitions. [2024-11-10 18:26:40,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 242 flow [2024-11-10 18:26:40,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 233 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-11-10 18:26:40,332 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 147 flow [2024-11-10 18:26:40,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2024-11-10 18:26:40,333 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2024-11-10 18:26:40,333 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 147 flow [2024-11-10 18:26:40,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 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:40,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:40,334 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:40,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 18:26:40,534 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:40,535 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:40,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash -405377752, now seen corresponding path program 2 times [2024-11-10 18:26:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:40,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806532747] [2024-11-10 18:26:40,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:40,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:40,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:40,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806532747] [2024-11-10 18:26:40,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806532747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:40,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591424757] [2024-11-10 18:26:40,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:26:40,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:40,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:40,605 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:40,607 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:40,656 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:26:40,657 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:26:40,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:26:40,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:40,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:40,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591424757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:26:40,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-10 18:26:40,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049233457] [2024-11-10 18:26:40,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:40,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:26:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:40,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:26:40,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:26:40,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-11-10 18:26:40,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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:40,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:40,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-11-10 18:26:40,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:40,822 INFO L124 PetriNetUnfolderBase]: 84/247 cut-off events. [2024-11-10 18:26:40,822 INFO L125 PetriNetUnfolderBase]: For 605/605 co-relation queries the response was YES. [2024-11-10 18:26:40,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 247 events. 84/247 cut-off events. For 605/605 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1038 event pairs, 20 based on Foata normal form. 12/258 useless extension candidates. Maximal degree in co-relation 690. Up to 93 conditions per place. [2024-11-10 18:26:40,824 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 21 selfloop transitions, 2 changer transitions 17/47 dead transitions. [2024-11-10 18:26:40,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 270 flow [2024-11-10 18:26:40,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:26:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:26:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-11-10 18:26:40,825 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-10 18:26:40,825 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 147 flow. Second operand 8 states and 128 transitions. [2024-11-10 18:26:40,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 270 flow [2024-11-10 18:26:40,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 256 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:40,827 INFO L231 Difference]: Finished difference. Result has 49 places, 25 transitions, 109 flow [2024-11-10 18:26:40,828 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=109, PETRI_PLACES=49, PETRI_TRANSITIONS=25} [2024-11-10 18:26:40,828 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2024-11-10 18:26:40,828 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 25 transitions, 109 flow [2024-11-10 18:26:40,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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:40,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:40,829 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:40,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 18:26:41,029 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:41,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:41,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:41,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1082125487, now seen corresponding path program 1 times [2024-11-10 18:26:41,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:41,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354629831] [2024-11-10 18:26:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:41,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:26:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:41,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:26:41,061 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:26:41,062 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-10 18:26:41,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-10 18:26:41,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-10 18:26:41,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-10 18:26:41,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-10 18:26:41,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:26:41,065 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:41,090 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:26:41,090 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:26:41,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:26:41 BasicIcfg [2024-11-10 18:26:41,094 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:26:41,095 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:26:41,095 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:26:41,095 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:26:41,095 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:38" (3/4) ... [2024-11-10 18:26:41,096 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:26:41,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:26:41,098 INFO L158 Benchmark]: Toolchain (without parser) took 3947.45ms. Allocated memory was 172.0MB in the beginning and 264.2MB in the end (delta: 92.3MB). Free memory was 97.7MB in the beginning and 96.1MB in the end (delta: 1.6MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2024-11-10 18:26:41,098 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:41,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.14ms. Allocated memory is still 172.0MB. Free memory was 97.4MB in the beginning and 132.0MB in the end (delta: -34.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-11-10 18:26:41,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.70ms. Allocated memory is still 172.0MB. Free memory was 132.0MB in the beginning and 129.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:41,099 INFO L158 Benchmark]: Boogie Preprocessor took 29.96ms. Allocated memory is still 172.0MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:41,099 INFO L158 Benchmark]: IcfgBuilder took 351.62ms. Allocated memory is still 172.0MB. Free memory was 127.8MB in the beginning and 107.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 18:26:41,099 INFO L158 Benchmark]: TraceAbstraction took 3018.95ms. Allocated memory was 172.0MB in the beginning and 264.2MB in the end (delta: 92.3MB). Free memory was 106.8MB in the beginning and 96.1MB in the end (delta: 10.7MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2024-11-10 18:26:41,100 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 264.2MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:41,101 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.16ms. Allocated memory is still 172.0MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.14ms. Allocated memory is still 172.0MB. Free memory was 97.4MB in the beginning and 132.0MB in the end (delta: -34.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.70ms. Allocated memory is still 172.0MB. Free memory was 132.0MB in the beginning and 129.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.96ms. Allocated memory is still 172.0MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 351.62ms. Allocated memory is still 172.0MB. Free memory was 127.8MB in the beginning and 107.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3018.95ms. Allocated memory was 172.0MB in the beginning and 264.2MB in the end (delta: 92.3MB). Free memory was 106.8MB in the beginning and 96.1MB in the end (delta: 10.7MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 264.2MB. Free memory is still 96.1MB. 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; [L770] 0 _N = 1 [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=1, limit=1] [L773] 0 int i = 0; VAL [_N=1, i=0, limit=1] [L773] COND TRUE 0 i < _N [L774] 0 pthread_t t; [L775] FCALL, FORK 0 pthread_create(&t, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, i=0, limit=1, t=-1] [L773] 0 ++i VAL [\old(arg)={0:0}, _N=1, i=1, limit=1] [L773] COND FALSE 0 !(i < _N) VAL [\old(arg)={0:0}, _N=1, i=1, limit=1] [L777] 0 pthread_t t; [L757] 1 int l; [L758] 1 l = limit VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1] [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1, t=0] [L759] 1 limit = l + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L763] 2 int i, bound; [L764] 2 bound = limit [L765] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L765] COND FALSE 2 !(i < bound) VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L766] CALL 2 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L752] 2 __assert_fail ("0", "generated/unwind3.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 775]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 5 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: 2.9s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 237 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 218 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 526 IncrementalHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 2 mSDtfsCounter, 526 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=7, InterpolantAutomatonStates: 40, 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, 0.8s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 630 SizeOfPredicates, 7 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 30/40 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:41,126 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/unwind3-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 ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:26:43,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:26:43,311 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:43,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:26:43,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:26:43,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:26:43,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:26:43,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:26:43,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:26:43,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:26:43,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:26:43,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:26:43,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:26:43,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:26:43,344 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:26:43,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:26:43,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:26:43,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:26:43,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:26:43,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:26:43,345 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:26:43,347 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:26:43,348 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:26:43,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:26:43,351 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:26:43,352 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:26:43,352 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:26:43,352 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:26:43,352 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:26:43,352 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:26:43,353 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:26:43,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:26:43,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:26:43,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:26:43,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:26:43,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:43,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:26:43,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:26:43,354 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:26:43,354 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:26:43,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:26:43,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:26:43,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:26:43,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:26:43,355 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 -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2024-11-10 18:26:43,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:26:43,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:26:43,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:26:43,672 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:26:43,673 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:26:43,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-10 18:26:45,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:26:45,606 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:26:45,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-10 18:26:45,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab706357a/172e829e1dac4b9b892db8ac29150c69/FLAGccfcf8ad4 [2024-11-10 18:26:45,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab706357a/172e829e1dac4b9b892db8ac29150c69 [2024-11-10 18:26:45,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:26:45,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:26:45,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:45,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:26:45,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:26:45,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:45" (1/1) ... [2024-11-10 18:26:45,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720ae61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:45, skipping insertion in model container [2024-11-10 18:26:45,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:45" (1/1) ... [2024-11-10 18:26:45,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:26:45,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:45,953 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:26:46,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:46,051 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:26:46,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:46 WrapperNode [2024-11-10 18:26:46,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:46,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:46,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:26:46,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:26:46,059 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:46" (1/1) ... [2024-11-10 18:26:46,079 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:46" (1/1) ... [2024-11-10 18:26:46,125 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 65 [2024-11-10 18:26:46,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:46,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:26:46,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:26:46,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:26:46,147 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:46" (1/1) ... [2024-11-10 18:26:46,147 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:46" (1/1) ... [2024-11-10 18:26:46,153 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:46" (1/1) ... [2024-11-10 18:26:46,172 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:46,176 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:46" (1/1) ... [2024-11-10 18:26:46,176 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:46" (1/1) ... [2024-11-10 18:26:46,181 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:46" (1/1) ... [2024-11-10 18:26:46,185 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:46" (1/1) ... [2024-11-10 18:26:46,187 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:46" (1/1) ... [2024-11-10 18:26:46,192 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:46" (1/1) ... [2024-11-10 18:26:46,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:26:46,199 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:26:46,199 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:26:46,199 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:26:46,200 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:46" (1/1) ... [2024-11-10 18:26:46,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:46,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:46,256 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:46,270 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:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:26:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-10 18:26:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-10 18:26:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-10 18:26:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-10 18:26:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:26:46,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:26:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:26:46,350 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:46,596 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:26:46,598 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:26:46,857 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:26:46,857 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:26:46,936 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:26:46,936 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:26:46,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:46 BoogieIcfgContainer [2024-11-10 18:26:46,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:26:46,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:26:46,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:26:46,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:26:46,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:26:45" (1/3) ... [2024-11-10 18:26:46,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6664fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:46, skipping insertion in model container [2024-11-10 18:26:46,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:46" (2/3) ... [2024-11-10 18:26:46,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6664fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:46, skipping insertion in model container [2024-11-10 18:26:46,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:46" (3/3) ... [2024-11-10 18:26:46,945 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2024-11-10 18:26:46,959 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:26:46,960 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 18:26:46,960 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:26:47,021 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:26:47,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 74 flow [2024-11-10 18:26:47,089 INFO L124 PetriNetUnfolderBase]: 10/55 cut-off events. [2024-11-10 18:26:47,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:47,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 55 events. 10/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 126 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2024-11-10 18:26:47,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 74 flow [2024-11-10 18:26:47,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 32 transitions, 71 flow [2024-11-10 18:26:47,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:26:47,115 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;@72a98f7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:26:47,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 18:26:47,127 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:26:47,129 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-10 18:26:47,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:47,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:47,130 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:47,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:47,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash -761791770, now seen corresponding path program 1 times [2024-11-10 18:26:47,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:47,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620657943] [2024-11-10 18:26:47,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:47,148 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,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:47,151 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:47,152 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:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:47,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 18:26:47,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:47,256 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:47,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:47,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:47,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620657943] [2024-11-10 18:26:47,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620657943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:47,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:47,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:26:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360685375] [2024-11-10 18:26:47,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:47,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:26:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:47,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:26:47,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:26:47,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-11-10 18:26:47,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 32 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:47,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-11-10 18:26:47,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:47,403 INFO L124 PetriNetUnfolderBase]: 109/261 cut-off events. [2024-11-10 18:26:47,403 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 18:26:47,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 261 events. 109/261 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1068 event pairs, 94 based on Foata normal form. 50/292 useless extension candidates. Maximal degree in co-relation 394. Up to 205 conditions per place. [2024-11-10 18:26:47,407 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 17 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2024-11-10 18:26:47,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 95 flow [2024-11-10 18:26:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:26:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:26:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2024-11-10 18:26:47,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-11-10 18:26:47,420 INFO L175 Difference]: Start difference. First operand has 33 places, 32 transitions, 71 flow. Second operand 2 states and 43 transitions. [2024-11-10 18:26:47,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 95 flow [2024-11-10 18:26:47,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:47,423 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 60 flow [2024-11-10 18:26:47,424 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-11-10 18:26:47,427 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2024-11-10 18:26:47,429 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 60 flow [2024-11-10 18:26:47,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:47,430 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:47,433 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:47,632 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:47,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:47,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:47,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2142850984, now seen corresponding path program 1 times [2024-11-10 18:26:47,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:47,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515216912] [2024-11-10 18:26:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:47,635 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,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:47,636 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:47,638 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:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:47,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:26:47,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:47,768 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:47,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:47,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515216912] [2024-11-10 18:26:47,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515216912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:47,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:47,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:26:47,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140026926] [2024-11-10 18:26:47,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:47,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:26:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:26:47,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:26:47,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-11-10 18:26:47,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:47,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-11-10 18:26:47,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:47,834 INFO L124 PetriNetUnfolderBase]: 101/246 cut-off events. [2024-11-10 18:26:47,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:47,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 246 events. 101/246 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 942 event pairs, 32 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 441. Up to 179 conditions per place. [2024-11-10 18:26:47,837 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 20 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-11-10 18:26:47,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 114 flow [2024-11-10 18:26:47,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:26:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:26:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-11-10 18:26:47,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-11-10 18:26:47,839 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 60 flow. Second operand 4 states and 60 transitions. [2024-11-10 18:26:47,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 114 flow [2024-11-10 18:26:47,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:26:47,841 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 70 flow [2024-11-10 18:26:47,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2024-11-10 18:26:47,842 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2024-11-10 18:26:47,842 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 70 flow [2024-11-10 18:26:47,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:47,843 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:47,846 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:48,046 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:48,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:48,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:48,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2068970643, now seen corresponding path program 1 times [2024-11-10 18:26:48,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:48,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645927497] [2024-11-10 18:26:48,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:48,048 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,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:48,051 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:48,052 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:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:48,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:26:48,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:48,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:48,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:48,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645927497] [2024-11-10 18:26:48,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645927497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:48,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:26:48,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-10 18:26:48,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804120944] [2024-11-10 18:26:48,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:48,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:26:48,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:48,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:26:48,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:26:48,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-11-10 18:26:48,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 70 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:48,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-11-10 18:26:48,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:48,277 INFO L124 PetriNetUnfolderBase]: 98/235 cut-off events. [2024-11-10 18:26:48,277 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-10 18:26:48,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 235 events. 98/235 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 879 event pairs, 32 based on Foata normal form. 4/227 useless extension candidates. Maximal degree in co-relation 437. Up to 158 conditions per place. [2024-11-10 18:26:48,278 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 21 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2024-11-10 18:26:48,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 129 flow [2024-11-10 18:26:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:26:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:26:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2024-11-10 18:26:48,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2024-11-10 18:26:48,283 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 70 flow. Second operand 5 states and 71 transitions. [2024-11-10 18:26:48,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 129 flow [2024-11-10 18:26:48,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:48,285 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 72 flow [2024-11-10 18:26:48,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2024-11-10 18:26:48,285 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2024-11-10 18:26:48,286 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 72 flow [2024-11-10 18:26:48,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:48,286 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:48,295 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:48,491 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:48,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:48,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash -373154912, now seen corresponding path program 1 times [2024-11-10 18:26:48,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:48,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467415461] [2024-11-10 18:26:48,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:48,494 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,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:48,496 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:48,497 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:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:48,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:26:48,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:48,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:48,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:48,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467415461] [2024-11-10 18:26:48,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467415461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:48,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:48,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:26:48,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520771464] [2024-11-10 18:26:48,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:48,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:26:48,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:48,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:26:48,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:26:48,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:48,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:48,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:48,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:48,668 INFO L124 PetriNetUnfolderBase]: 95/224 cut-off events. [2024-11-10 18:26:48,668 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 18:26:48,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 224 events. 95/224 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 818 event pairs, 83 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 425. Up to 170 conditions per place. [2024-11-10 18:26:48,673 INFO L140 encePairwiseOnDemand]: 31/33 looper letters, 15 selfloop transitions, 1 changer transitions 1/25 dead transitions. [2024-11-10 18:26:48,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 104 flow [2024-11-10 18:26:48,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:26:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:26:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-10 18:26:48,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-10 18:26:48,680 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 72 flow. Second operand 3 states and 48 transitions. [2024-11-10 18:26:48,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 104 flow [2024-11-10 18:26:48,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 96 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:48,681 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 62 flow [2024-11-10 18:26:48,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2024-11-10 18:26:48,682 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2024-11-10 18:26:48,682 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 62 flow [2024-11-10 18:26:48,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:48,682 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:48,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 18:26:48,886 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:48,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:48,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:48,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1980569634, now seen corresponding path program 1 times [2024-11-10 18:26:48,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:48,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574108369] [2024-11-10 18:26:48,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:48,888 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,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:48,891 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:48,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 18:26:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:48,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:26:48,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:48,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:48,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:48,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574108369] [2024-11-10 18:26:48,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574108369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:48,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:48,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:26:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64329212] [2024-11-10 18:26:48,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:48,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:26:48,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:48,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:26:48,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:26:48,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:48,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:48,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:48,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:49,083 INFO L124 PetriNetUnfolderBase]: 112/257 cut-off events. [2024-11-10 18:26:49,084 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 18:26:49,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 257 events. 112/257 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 952 event pairs, 45 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 478. Up to 99 conditions per place. [2024-11-10 18:26:49,086 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 29 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-11-10 18:26:49,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 177 flow [2024-11-10 18:26:49,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:26:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:26:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-11-10 18:26:49,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2024-11-10 18:26:49,088 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 62 flow. Second operand 6 states and 98 transitions. [2024-11-10 18:26:49,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 177 flow [2024-11-10 18:26:49,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:49,089 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 102 flow [2024-11-10 18:26:49,089 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-11-10 18:26:49,090 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2024-11-10 18:26:49,090 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 102 flow [2024-11-10 18:26:49,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:49,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:49,090 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:49,097 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 (6)] Forceful destruction successful, exit code 0 [2024-11-10 18:26:49,291 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:49,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:49,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash -851976983, now seen corresponding path program 1 times [2024-11-10 18:26:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:49,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634564741] [2024-11-10 18:26:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:49,293 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:49,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:49,296 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:49,299 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:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:49,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:26:49,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:49,400 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:49,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:49,479 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:49,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:49,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634564741] [2024-11-10 18:26:49,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634564741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:49,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:26:49,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-10 18:26:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397964796] [2024-11-10 18:26:49,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:49,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:26:49,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:49,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:26:49,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:26:49,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:49,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 102 flow. Second operand has 12 states, 12 states have (on average 12.0) internal successors, (144), 12 states have internal predecessors, (144), 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:49,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:49,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:49,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:49,737 INFO L124 PetriNetUnfolderBase]: 126/258 cut-off events. [2024-11-10 18:26:49,737 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-11-10 18:26:49,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 258 events. 126/258 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 988 event pairs, 8 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 662. Up to 98 conditions per place. [2024-11-10 18:26:49,739 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 40 selfloop transitions, 14 changer transitions 0/61 dead transitions. [2024-11-10 18:26:49,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 318 flow [2024-11-10 18:26:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:26:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:26:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2024-11-10 18:26:49,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-11-10 18:26:49,740 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 102 flow. Second operand 10 states and 155 transitions. [2024-11-10 18:26:49,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 318 flow [2024-11-10 18:26:49,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:26:49,751 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 165 flow [2024-11-10 18:26:49,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2024-11-10 18:26:49,751 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2024-11-10 18:26:49,752 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 165 flow [2024-11-10 18:26:49,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.0) internal successors, (144), 12 states have internal predecessors, (144), 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:49,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:49,752 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:49,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 18:26:49,955 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:49,956 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:49,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1426050661, now seen corresponding path program 1 times [2024-11-10 18:26:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:49,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950128527] [2024-11-10 18:26:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:49,957 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:49,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:49,961 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:49,963 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:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:50,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:26:50,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:50,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:50,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:50,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950128527] [2024-11-10 18:26:50,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950128527] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:50,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:26:50,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 18:26:50,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322331344] [2024-11-10 18:26:50,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:50,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:26:50,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:50,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:26:50,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:26:50,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:50,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 165 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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:50,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:50,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:50,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:51,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-10 18:26:52,164 INFO L124 PetriNetUnfolderBase]: 296/661 cut-off events. [2024-11-10 18:26:52,164 INFO L125 PetriNetUnfolderBase]: For 1104/1132 co-relation queries the response was YES. [2024-11-10 18:26:52,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 661 events. 296/661 cut-off events. For 1104/1132 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3203 event pairs, 57 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 1814. Up to 142 conditions per place. [2024-11-10 18:26:52,168 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 11 changer transitions 26/81 dead transitions. [2024-11-10 18:26:52,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 475 flow [2024-11-10 18:26:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:26:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:26:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-11-10 18:26:52,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-11-10 18:26:52,169 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 165 flow. Second operand 10 states and 170 transitions. [2024-11-10 18:26:52,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 475 flow [2024-11-10 18:26:52,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 405 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-11-10 18:26:52,176 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 191 flow [2024-11-10 18:26:52,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=191, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2024-11-10 18:26:52,177 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2024-11-10 18:26:52,177 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 35 transitions, 191 flow [2024-11-10 18:26:52,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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:52,178 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:52,178 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:52,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 18:26:52,381 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:52,383 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:52,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:52,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1109262312, now seen corresponding path program 2 times [2024-11-10 18:26:52,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:52,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626022374] [2024-11-10 18:26:52,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:26:52,384 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:52,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:52,390 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:52,391 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:52,430 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:26:52,431 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:26:52,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:26:52,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:52,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:26:52,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:52,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626022374] [2024-11-10 18:26:52,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626022374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:52,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:26:52,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-10 18:26:52,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562410474] [2024-11-10 18:26:52,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:52,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:26:52,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:52,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:26:52,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:26:52,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:52,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 35 transitions, 191 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 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:52,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:52,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:52,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:52,748 INFO L124 PetriNetUnfolderBase]: 150/361 cut-off events. [2024-11-10 18:26:52,748 INFO L125 PetriNetUnfolderBase]: For 777/777 co-relation queries the response was YES. [2024-11-10 18:26:52,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 361 events. 150/361 cut-off events. For 777/777 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1387 event pairs, 20 based on Foata normal form. 12/372 useless extension candidates. Maximal degree in co-relation 1019. Up to 93 conditions per place. [2024-11-10 18:26:52,750 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 25 selfloop transitions, 4 changer transitions 21/56 dead transitions. [2024-11-10 18:26:52,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 343 flow [2024-11-10 18:26:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:26:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:26:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2024-11-10 18:26:52,752 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44242424242424244 [2024-11-10 18:26:52,752 INFO L175 Difference]: Start difference. First operand has 55 places, 35 transitions, 191 flow. Second operand 10 states and 146 transitions. [2024-11-10 18:26:52,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 343 flow [2024-11-10 18:26:52,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 328 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:52,754 INFO L231 Difference]: Finished difference. Result has 55 places, 27 transitions, 130 flow [2024-11-10 18:26:52,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=130, PETRI_PLACES=55, PETRI_TRANSITIONS=27} [2024-11-10 18:26:52,755 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2024-11-10 18:26:52,755 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 27 transitions, 130 flow [2024-11-10 18:26:52,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 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:52,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:52,756 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:52,760 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:52,958 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:52,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:52,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:52,960 INFO L85 PathProgramCache]: Analyzing trace with hash 657313711, now seen corresponding path program 1 times [2024-11-10 18:26:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:52,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111347696] [2024-11-10 18:26:52,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:52,961 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:52,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:52,963 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:52,964 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:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:53,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:26:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:53,039 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 18:26:53,039 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:26:53,040 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-10 18:26:53,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-10 18:26:53,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-10 18:26:53,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-10 18:26:53,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-10 18:26:53,046 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:53,245 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:53,246 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:53,274 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:26:53,274 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:26:53,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:26:53 BasicIcfg [2024-11-10 18:26:53,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:26:53,281 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:26:53,281 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:26:53,281 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:26:53,283 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:46" (3/4) ... [2024-11-10 18:26:53,285 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:26:53,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:26:53,287 INFO L158 Benchmark]: Toolchain (without parser) took 7653.05ms. Allocated memory was 73.4MB in the beginning and 140.5MB in the end (delta: 67.1MB). Free memory was 34.0MB in the beginning and 62.8MB in the end (delta: -28.9MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2024-11-10 18:26:53,287 INFO L158 Benchmark]: CDTParser took 4.27ms. Allocated memory is still 73.4MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:53,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.07ms. Allocated memory is still 73.4MB. Free memory was 33.8MB in the beginning and 31.7MB in the end (delta: 2.1MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-11-10 18:26:53,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.95ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 31.7MB in the beginning and 84.3MB in the end (delta: -52.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:26:53,287 INFO L158 Benchmark]: Boogie Preprocessor took 70.33ms. Allocated memory is still 104.9MB. Free memory was 84.3MB in the beginning and 82.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:53,288 INFO L158 Benchmark]: IcfgBuilder took 738.43ms. Allocated memory is still 104.9MB. Free memory was 82.2MB in the beginning and 56.6MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 18:26:53,288 INFO L158 Benchmark]: TraceAbstraction took 6341.89ms. Allocated memory was 104.9MB in the beginning and 140.5MB in the end (delta: 35.7MB). Free memory was 56.2MB in the beginning and 62.8MB in the end (delta: -6.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-11-10 18:26:53,288 INFO L158 Benchmark]: Witness Printer took 5.04ms. Allocated memory is still 140.5MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:53,292 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.27ms. Allocated memory is still 73.4MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.07ms. Allocated memory is still 73.4MB. Free memory was 33.8MB in the beginning and 31.7MB in the end (delta: 2.1MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.95ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 31.7MB in the beginning and 84.3MB in the end (delta: -52.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.33ms. Allocated memory is still 104.9MB. Free memory was 84.3MB in the beginning and 82.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 738.43ms. Allocated memory is still 104.9MB. Free memory was 82.2MB in the beginning and 56.6MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6341.89ms. Allocated memory was 104.9MB in the beginning and 140.5MB in the end (delta: 35.7MB). Free memory was 56.2MB in the beginning and 62.8MB in the end (delta: -6.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 5.04ms. Allocated memory is still 140.5MB. Free memory is still 62.8MB. 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; [L770] 0 _N = 1 [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=1, limit=1] [L773] 0 int i = 0; VAL [_N=1, i=0, limit=1] [L773] COND TRUE 0 i < _N [L774] 0 pthread_t t; [L775] FCALL, FORK 0 pthread_create(&t, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, i=0, limit=1, t=-1] [L773] 0 ++i VAL [\old(arg)={0:0}, _N=1, i=1, limit=1] [L773] COND FALSE 0 !(i < _N) VAL [\old(arg)={0:0}, _N=1, i=1, limit=1] [L777] 0 pthread_t t; [L757] 1 int l; [L758] 1 l = limit VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1] [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1, t=0] [L759] 1 limit = l + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L763] 2 int i, bound; [L764] 2 bound = limit [L765] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L765] COND FALSE 2 !(i < bound) VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L766] CALL 2 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L752] 2 __assert_fail ("0", "generated/unwind3.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 775]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 5 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.2s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 356 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 808 IncrementalHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 7 mSDtfsCounter, 808 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=7, InterpolantAutomatonStates: 50, 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.6s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 180 ConstructedInterpolants, 5 QuantifiedInterpolants, 562 SizeOfPredicates, 12 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 22/38 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:53,337 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