./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/unwind1-100.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 d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:59:46,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:59:46,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:59:46,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:59:46,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:59:46,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:59:46,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:59:46,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:59:46,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:59:46,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:59:46,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:59:46,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:59:46,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:59:46,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:59:46,309 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:59:46,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:59:46,309 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:59:46,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:59:46,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:59:46,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:59:46,310 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:59:46,313 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:59:46,313 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:59:46,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:59:46,313 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:59:46,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:59:46,314 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:59:46,314 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:59:46,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:59:46,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:59:46,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:59:46,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:59:46,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:59:46,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:59:46,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:59:46,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:59:46,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:59:46,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:59:46,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:59:46,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:59:46,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:59:46,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:59:46,318 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2024-11-09 10:59:46,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:59:46,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:59:46,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:59:46,617 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:59:46,617 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:59:46,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-09 10:59:48,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:59:48,360 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:59:48,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-09 10:59:48,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8910e1568/2fb4b955827e4bbdb37815dad3586e06/FLAG57dd8fab8 [2024-11-09 10:59:48,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8910e1568/2fb4b955827e4bbdb37815dad3586e06 [2024-11-09 10:59:48,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:59:48,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:59:48,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:59:48,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:59:48,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:59:48,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:59:48" (1/1) ... [2024-11-09 10:59:48,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620cf18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:48, skipping insertion in model container [2024-11-09 10:59:48,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:59:48" (1/1) ... [2024-11-09 10:59:48,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:59:49,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:59:49,124 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:59:49,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:59:49,198 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:59:49,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49 WrapperNode [2024-11-09 10:59:49,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:59:49,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:59:49,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:59:49,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:59:49,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,239 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 56 [2024-11-09 10:59:49,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:59:49,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:59:49,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:59:49,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:59:49,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,262 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-09 10:59:49,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:59:49,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:59:49,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:59:49,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:59:49,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (1/1) ... [2024-11-09 10:59:49,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:59:49,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:49,320 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-09 10:59:49,323 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-09 10:59:49,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:59:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-09 10:59:49,376 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-09 10:59:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-09 10:59:49,376 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-09 10:59:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:59:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:59:49,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:59:49,381 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:59:49,526 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:59:49,529 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:59:49,685 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:59:49,686 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:59:49,789 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:59:49,790 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 10:59:49,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:49 BoogieIcfgContainer [2024-11-09 10:59:49,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:59:49,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:59:49,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:59:49,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:59:49,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:59:48" (1/3) ... [2024-11-09 10:59:49,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f768c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:59:49, skipping insertion in model container [2024-11-09 10:59:49,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:49" (2/3) ... [2024-11-09 10:59:49,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f768c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:59:49, skipping insertion in model container [2024-11-09 10:59:49,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:49" (3/3) ... [2024-11-09 10:59:49,799 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-09 10:59:49,817 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:59:49,818 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:59:49,818 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:59:49,871 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:59:49,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-11-09 10:59:49,926 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-09 10:59:49,926 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:59:49,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-11-09 10:59:49,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-11-09 10:59:49,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2024-11-09 10:59:49,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:59:49,946 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;@26f32690, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:59:49,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 10:59:49,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:59:49,958 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2024-11-09 10:59:49,958 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:59:49,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:49,959 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:49,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 10:59:49,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:49,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1073741351, now seen corresponding path program 1 times [2024-11-09 10:59:49,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:49,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903012520] [2024-11-09 10:59:49,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:49,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:50,415 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-09 10:59:50,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:50,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903012520] [2024-11-09 10:59:50,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903012520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:50,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:50,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:59:50,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137902773] [2024-11-09 10:59:50,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:50,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:59:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:50,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:59:50,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:59:50,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:59:50,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-09 10:59:50,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:50,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:59:50,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:50,743 INFO L124 PetriNetUnfolderBase]: 152/302 cut-off events. [2024-11-09 10:59:50,743 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-09 10:59:50,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 302 events. 152/302 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1213 event pairs, 68 based on Foata normal form. 22/268 useless extension candidates. Maximal degree in co-relation 532. Up to 146 conditions per place. [2024-11-09 10:59:50,749 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 33 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2024-11-09 10:59:50,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 196 flow [2024-11-09 10:59:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:59:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:59:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-11-09 10:59:50,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2024-11-09 10:59:50,768 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 6 states and 91 transitions. [2024-11-09 10:59:50,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 196 flow [2024-11-09 10:59:50,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 46 transitions, 180 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:59:50,774 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 91 flow [2024-11-09 10:59:50,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=91, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-11-09 10:59:50,780 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2024-11-09 10:59:50,781 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 91 flow [2024-11-09 10:59:50,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-09 10:59:50,781 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:50,781 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:50,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:59:50,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 10:59:50,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:50,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1072770645, now seen corresponding path program 1 times [2024-11-09 10:59:50,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:50,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186037031] [2024-11-09 10:59:50,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:50,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186037031] [2024-11-09 10:59:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186037031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:50,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:50,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:59:50,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386911388] [2024-11-09 10:59:50,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:50,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:59:50,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:50,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:59:50,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:59:50,925 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-09 10:59:50,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-09 10:59:50,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:50,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-09 10:59:50,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:51,056 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2024-11-09 10:59:51,056 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2024-11-09 10:59:51,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 247 events. 111/247 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 936 event pairs, 30 based on Foata normal form. 13/245 useless extension candidates. Maximal degree in co-relation 312. Up to 97 conditions per place. [2024-11-09 10:59:51,059 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2024-11-09 10:59:51,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 228 flow [2024-11-09 10:59:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:59:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:59:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-11-09 10:59:51,061 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2024-11-09 10:59:51,062 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 91 flow. Second operand 5 states and 73 transitions. [2024-11-09 10:59:51,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 228 flow [2024-11-09 10:59:51,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:51,065 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 127 flow [2024-11-09 10:59:51,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-09 10:59:51,066 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-11-09 10:59:51,066 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 127 flow [2024-11-09 10:59:51,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-09 10:59:51,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:51,067 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:51,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:59:51,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 10:59:51,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1251716570, now seen corresponding path program 1 times [2024-11-09 10:59:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:51,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88611267] [2024-11-09 10:59:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:51,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88611267] [2024-11-09 10:59:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88611267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:51,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399610434] [2024-11-09 10:59:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:51,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:51,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:51,243 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-09 10:59:51,245 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-09 10:59:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:51,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:59:51,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:51,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:51,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399610434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:51,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:59:51,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-09 10:59:51,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160025057] [2024-11-09 10:59:51,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:51,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:59:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:51,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:59:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:59:51,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-09 10:59:51,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 127 flow. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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-09 10:59:51,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:51,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-09 10:59:51,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:51,903 INFO L124 PetriNetUnfolderBase]: 140/279 cut-off events. [2024-11-09 10:59:51,903 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-11-09 10:59:51,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 279 events. 140/279 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 896 event pairs, 21 based on Foata normal form. 5/267 useless extension candidates. Maximal degree in co-relation 458. Up to 65 conditions per place. [2024-11-09 10:59:51,907 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 48 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2024-11-09 10:59:51,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 376 flow [2024-11-09 10:59:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:59:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:59:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2024-11-09 10:59:51,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3952254641909814 [2024-11-09 10:59:51,910 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 127 flow. Second operand 13 states and 149 transitions. [2024-11-09 10:59:51,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 376 flow [2024-11-09 10:59:51,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:51,916 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 212 flow [2024-11-09 10:59:51,916 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2024-11-09 10:59:51,917 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2024-11-09 10:59:51,917 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 212 flow [2024-11-09 10:59:51,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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-09 10:59:51,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:51,918 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:51,937 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-09 10:59:52,122 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-09 10:59:52,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 10:59:52,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 3331892, now seen corresponding path program 2 times [2024-11-09 10:59:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:52,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273614463] [2024-11-09 10:59:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 10:59:52,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:52,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273614463] [2024-11-09 10:59:52,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273614463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:52,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103799733] [2024-11-09 10:59:52,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:59:52,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:52,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:52,271 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-09 10:59:52,273 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-09 10:59:52,339 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:59:52,339 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:59:52,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:59:52,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:52,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:52,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103799733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:52,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:59:52,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2024-11-09 10:59:52,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309254441] [2024-11-09 10:59:52,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:52,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:59:52,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:52,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:59:52,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:59:52,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-09 10:59:52,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 212 flow. Second operand has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 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-09 10:59:52,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:52,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-09 10:59:52,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:53,647 INFO L124 PetriNetUnfolderBase]: 422/889 cut-off events. [2024-11-09 10:59:53,647 INFO L125 PetriNetUnfolderBase]: For 717/717 co-relation queries the response was YES. [2024-11-09 10:59:53,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2892 conditions, 889 events. 422/889 cut-off events. For 717/717 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4256 event pairs, 32 based on Foata normal form. 60/937 useless extension candidates. Maximal degree in co-relation 2423. Up to 189 conditions per place. [2024-11-09 10:59:53,656 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 182 selfloop transitions, 58 changer transitions 0/244 dead transitions. [2024-11-09 10:59:53,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 244 transitions, 1478 flow [2024-11-09 10:59:53,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-09 10:59:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-09 10:59:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 525 transitions. [2024-11-09 10:59:53,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39355322338830584 [2024-11-09 10:59:53,665 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 212 flow. Second operand 46 states and 525 transitions. [2024-11-09 10:59:53,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 244 transitions, 1478 flow [2024-11-09 10:59:53,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 244 transitions, 1340 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-11-09 10:59:53,680 INFO L231 Difference]: Finished difference. Result has 100 places, 81 transitions, 618 flow [2024-11-09 10:59:53,680 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=618, PETRI_PLACES=100, PETRI_TRANSITIONS=81} [2024-11-09 10:59:53,682 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2024-11-09 10:59:53,682 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 81 transitions, 618 flow [2024-11-09 10:59:53,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 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-09 10:59:53,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:53,683 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:53,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:59:53,883 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,SelfDestructingSolverStorable3 [2024-11-09 10:59:53,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 10:59:53,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1491532552, now seen corresponding path program 1 times [2024-11-09 10:59:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:53,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220196019] [2024-11-09 10:59:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:53,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:53,925 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-09 10:59:53,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:53,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220196019] [2024-11-09 10:59:53,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220196019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:53,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:53,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:59:53,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916036029] [2024-11-09 10:59:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:53,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:59:53,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:53,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:59:53,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:59:53,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:59:53,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 81 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-09 10:59:53,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:53,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:59:53,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:54,036 INFO L124 PetriNetUnfolderBase]: 321/761 cut-off events. [2024-11-09 10:59:54,036 INFO L125 PetriNetUnfolderBase]: For 1274/1274 co-relation queries the response was YES. [2024-11-09 10:59:54,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2706 conditions, 761 events. 321/761 cut-off events. For 1274/1274 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3945 event pairs, 291 based on Foata normal form. 15/762 useless extension candidates. Maximal degree in co-relation 2486. Up to 645 conditions per place. [2024-11-09 10:59:54,042 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 22 selfloop transitions, 1 changer transitions 53/80 dead transitions. [2024-11-09 10:59:54,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 80 transitions, 752 flow [2024-11-09 10:59:54,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:59:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:59:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-09 10:59:54,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2024-11-09 10:59:54,043 INFO L175 Difference]: Start difference. First operand has 100 places, 81 transitions, 618 flow. Second operand 3 states and 41 transitions. [2024-11-09 10:59:54,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 80 transitions, 752 flow [2024-11-09 10:59:54,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 80 transitions, 548 flow, removed 84 selfloop flow, removed 8 redundant places. [2024-11-09 10:59:54,062 INFO L231 Difference]: Finished difference. Result has 93 places, 27 transitions, 113 flow [2024-11-09 10:59:54,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=93, PETRI_TRANSITIONS=27} [2024-11-09 10:59:54,065 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-11-09 10:59:54,065 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 27 transitions, 113 flow [2024-11-09 10:59:54,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-09 10:59:54,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:54,066 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:54,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:59:54,066 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-09 10:59:54,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1963520340, now seen corresponding path program 1 times [2024-11-09 10:59:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:54,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453108699] [2024-11-09 10:59:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:54,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453108699] [2024-11-09 10:59:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453108699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285845589] [2024-11-09 10:59:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:54,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:54,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:54,325 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-09 10:59:54,327 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-09 10:59:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:54,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 10:59:54,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:54,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:55,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285845589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:55,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:59:55,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2024-11-09 10:59:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757220322] [2024-11-09 10:59:55,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:55,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 10:59:55,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:55,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 10:59:55,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 10:59:55,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-09 10:59:55,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 27 transitions, 113 flow. Second operand has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 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-09 10:59:55,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:55,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-09 10:59:55,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:55,920 INFO L124 PetriNetUnfolderBase]: 147/309 cut-off events. [2024-11-09 10:59:55,921 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2024-11-09 10:59:55,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 309 events. 147/309 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 726 event pairs, 15 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 800. Up to 79 conditions per place. [2024-11-09 10:59:55,923 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 80 selfloop transitions, 25 changer transitions 4/111 dead transitions. [2024-11-09 10:59:55,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 111 transitions, 547 flow [2024-11-09 10:59:55,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 10:59:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-09 10:59:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 283 transitions. [2024-11-09 10:59:55,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3614303959131545 [2024-11-09 10:59:55,926 INFO L175 Difference]: Start difference. First operand has 93 places, 27 transitions, 113 flow. Second operand 27 states and 283 transitions. [2024-11-09 10:59:55,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 111 transitions, 547 flow [2024-11-09 10:59:55,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 502 flow, removed 13 selfloop flow, removed 20 redundant places. [2024-11-09 10:59:55,929 INFO L231 Difference]: Finished difference. Result has 71 places, 38 transitions, 211 flow [2024-11-09 10:59:55,929 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=211, PETRI_PLACES=71, PETRI_TRANSITIONS=38} [2024-11-09 10:59:55,929 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 42 predicate places. [2024-11-09 10:59:55,930 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 38 transitions, 211 flow [2024-11-09 10:59:55,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 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-09 10:59:55,930 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:55,930 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:55,949 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-09 10:59:56,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:56,131 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-09 10:59:56,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1880608212, now seen corresponding path program 2 times [2024-11-09 10:59:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:56,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867782313] [2024-11-09 10:59:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867782313] [2024-11-09 10:59:56,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867782313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543412979] [2024-11-09 10:59:56,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:59:56,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:56,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:56,751 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:59:56,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 10:59:56,819 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:59:56,819 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:59:56,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 10:59:56,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:57,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:58,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543412979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:58,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:59:58,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2024-11-09 10:59:58,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323392846] [2024-11-09 10:59:58,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:58,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-09 10:59:58,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:58,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-09 10:59:58,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=4259, Unknown=0, NotChecked=0, Total=5700 [2024-11-09 10:59:58,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-09 10:59:58,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 38 transitions, 211 flow. Second operand has 76 states, 76 states have (on average 7.171052631578948) internal successors, (545), 76 states have internal predecessors, (545), 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-09 10:59:58,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:58,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-09 10:59:58,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:01,030 INFO L124 PetriNetUnfolderBase]: 262/539 cut-off events. [2024-11-09 11:00:01,031 INFO L125 PetriNetUnfolderBase]: For 8287/8287 co-relation queries the response was YES. [2024-11-09 11:00:01,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 539 events. 262/539 cut-off events. For 8287/8287 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1245 event pairs, 15 based on Foata normal form. 120/659 useless extension candidates. Maximal degree in co-relation 1635. Up to 199 conditions per place. [2024-11-09 11:00:01,034 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 152 selfloop transitions, 49 changer transitions 0/203 dead transitions. [2024-11-09 11:00:01,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 203 transitions, 1086 flow [2024-11-09 11:00:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-09 11:00:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2024-11-09 11:00:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 525 transitions. [2024-11-09 11:00:01,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2024-11-09 11:00:01,037 INFO L175 Difference]: Start difference. First operand has 71 places, 38 transitions, 211 flow. Second operand 50 states and 525 transitions. [2024-11-09 11:00:01,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 203 transitions, 1086 flow [2024-11-09 11:00:01,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 203 transitions, 1015 flow, removed 24 selfloop flow, removed 12 redundant places. [2024-11-09 11:00:01,048 INFO L231 Difference]: Finished difference. Result has 128 places, 62 transitions, 480 flow [2024-11-09 11:00:01,048 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=480, PETRI_PLACES=128, PETRI_TRANSITIONS=62} [2024-11-09 11:00:01,049 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2024-11-09 11:00:01,049 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 62 transitions, 480 flow [2024-11-09 11:00:01,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 7.171052631578948) internal successors, (545), 76 states have internal predecessors, (545), 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-09 11:00:01,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:01,051 INFO L204 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:01,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:00:01,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:00:01,254 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-09 11:00:01,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash -324974892, now seen corresponding path program 3 times [2024-11-09 11:00:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:00:01,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139721382] [2024-11-09 11:00:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:00:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:02,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:00:02,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139721382] [2024-11-09 11:00:02,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139721382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:00:02,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581436632] [2024-11-09 11:00:02,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:00:02,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:00:02,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:00:02,899 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:00:02,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:00:02,985 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2024-11-09 11:00:02,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:00:02,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 11:00:02,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:04,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:00:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:08,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581436632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:00:08,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:00:08,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2024-11-09 11:00:08,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189165512] [2024-11-09 11:00:08,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:00:08,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2024-11-09 11:00:08,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:00:08,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2024-11-09 11:00:08,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5749, Invalid=16007, Unknown=0, NotChecked=0, Total=21756 [2024-11-09 11:00:08,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-09 11:00:08,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 62 transitions, 480 flow. Second operand has 148 states, 148 states have (on average 7.087837837837838) internal successors, (1049), 148 states have internal predecessors, (1049), 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-09 11:00:08,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:08,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-09 11:00:08,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:15,493 INFO L124 PetriNetUnfolderBase]: 502/1019 cut-off events. [2024-11-09 11:00:15,493 INFO L125 PetriNetUnfolderBase]: For 154385/154385 co-relation queries the response was YES. [2024-11-09 11:00:15,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3672 conditions, 1019 events. 502/1019 cut-off events. For 154385/154385 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2365 event pairs, 15 based on Foata normal form. 240/1259 useless extension candidates. Maximal degree in co-relation 3629. Up to 379 conditions per place. [2024-11-09 11:00:15,500 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 296 selfloop transitions, 97 changer transitions 0/395 dead transitions. [2024-11-09 11:00:15,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 395 transitions, 2315 flow [2024-11-09 11:00:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-09 11:00:15,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2024-11-09 11:00:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1029 transitions. [2024-11-09 11:00:15,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2024-11-09 11:00:15,504 INFO L175 Difference]: Start difference. First operand has 128 places, 62 transitions, 480 flow. Second operand 98 states and 1029 transitions. [2024-11-09 11:00:15,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 395 transitions, 2315 flow [2024-11-09 11:00:15,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 395 transitions, 2023 flow, removed 121 selfloop flow, removed 25 redundant places. [2024-11-09 11:00:15,550 INFO L231 Difference]: Finished difference. Result has 248 places, 110 transitions, 960 flow [2024-11-09 11:00:15,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=960, PETRI_PLACES=248, PETRI_TRANSITIONS=110} [2024-11-09 11:00:15,550 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 219 predicate places. [2024-11-09 11:00:15,551 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 110 transitions, 960 flow [2024-11-09 11:00:15,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 7.087837837837838) internal successors, (1049), 148 states have internal predecessors, (1049), 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-09 11:00:15,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:15,552 INFO L204 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:15,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:00:15,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:00:15,753 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-09 11:00:15,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1659058388, now seen corresponding path program 4 times [2024-11-09 11:00:15,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:00:15,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605677044] [2024-11-09 11:00:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:15,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:00:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:20,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:00:20,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605677044] [2024-11-09 11:00:20,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605677044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:00:20,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684630464] [2024-11-09 11:00:20,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 11:00:20,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:00:20,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:00:20,420 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:00:20,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:00:20,507 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 11:00:20,507 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:00:20,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-09 11:00:20,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:27,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:00:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:37,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684630464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:00:37,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:00:37,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 291 [2024-11-09 11:00:37,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127287240] [2024-11-09 11:00:37,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:00:37,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 292 states [2024-11-09 11:00:37,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:00:37,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 292 interpolants. [2024-11-09 11:00:37,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19089, Invalid=65883, Unknown=0, NotChecked=0, Total=84972 [2024-11-09 11:00:37,731 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-09 11:00:37,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 110 transitions, 960 flow. Second operand has 292 states, 292 states have (on average 7.044520547945205) internal successors, (2057), 292 states have internal predecessors, (2057), 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-09 11:00:37,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:37,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-09 11:00:37,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:48,951 INFO L124 PetriNetUnfolderBase]: 537/1089 cut-off events. [2024-11-09 11:00:48,951 INFO L125 PetriNetUnfolderBase]: For 139338/139338 co-relation queries the response was YES. [2024-11-09 11:00:48,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4205 conditions, 1089 events. 537/1089 cut-off events. For 139338/139338 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2529 event pairs, 15 based on Foata normal form. 35/1124 useless extension candidates. Maximal degree in co-relation 4114. Up to 294 conditions per place. [2024-11-09 11:00:48,960 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 317 selfloop transitions, 104 changer transitions 0/423 dead transitions. [2024-11-09 11:00:48,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 423 transitions, 2572 flow [2024-11-09 11:00:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-09 11:00:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2024-11-09 11:00:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1058 transitions. [2024-11-09 11:00:48,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3474548440065681 [2024-11-09 11:00:48,964 INFO L175 Difference]: Start difference. First operand has 248 places, 110 transitions, 960 flow. Second operand 105 states and 1058 transitions. [2024-11-09 11:00:48,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 423 transitions, 2572 flow [2024-11-09 11:00:49,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 423 transitions, 2170 flow, removed 152 selfloop flow, removed 49 redundant places. [2024-11-09 11:00:49,133 INFO L231 Difference]: Finished difference. Result has 310 places, 117 transitions, 852 flow [2024-11-09 11:00:49,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=852, PETRI_PLACES=310, PETRI_TRANSITIONS=117} [2024-11-09 11:00:49,134 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 281 predicate places. [2024-11-09 11:00:49,134 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 117 transitions, 852 flow [2024-11-09 11:00:49,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 292 states, 292 states have (on average 7.044520547945205) internal successors, (2057), 292 states have internal predecessors, (2057), 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-09 11:00:49,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:49,136 INFO L204 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:49,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 11:00:49,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:00:49,337 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 11:00:49,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:49,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1932068742, now seen corresponding path program 5 times [2024-11-09 11:00:49,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:00:49,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266139973] [2024-11-09 11:00:49,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:49,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:00:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:00:49,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 11:00:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:00:49,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 11:00:49,511 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 11:00:49,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-09 11:00:49,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-09 11:00:49,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-09 11:00:49,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-09 11:00:49,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-09 11:00:49,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:00:49,516 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1] [2024-11-09 11:00:49,661 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 11:00:49,661 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:00:49,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:00:49 BasicIcfg [2024-11-09 11:00:49,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:00:49,665 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:00:49,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:00:49,666 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:00:49,667 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:49" (3/4) ... [2024-11-09 11:00:49,668 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 11:00:49,670 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:00:49,670 INFO L158 Benchmark]: Toolchain (without parser) took 61015.85ms. Allocated memory was 161.5MB in the beginning and 851.4MB in the end (delta: 690.0MB). Free memory was 101.6MB in the beginning and 500.8MB in the end (delta: -399.2MB). Peak memory consumption was 290.8MB. Max. memory is 16.1GB. [2024-11-09 11:00:49,670 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:00:49,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.19ms. Allocated memory is still 161.5MB. Free memory was 101.3MB in the beginning and 123.5MB in the end (delta: -22.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 11:00:49,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.00ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:00:49,671 INFO L158 Benchmark]: Boogie Preprocessor took 36.82ms. Allocated memory is still 161.5MB. Free memory was 121.4MB in the beginning and 119.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:00:49,671 INFO L158 Benchmark]: RCFGBuilder took 510.63ms. Allocated memory is still 161.5MB. Free memory was 119.3MB in the beginning and 99.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 11:00:49,672 INFO L158 Benchmark]: TraceAbstraction took 59872.72ms. Allocated memory was 161.5MB in the beginning and 851.4MB in the end (delta: 690.0MB). Free memory was 99.1MB in the beginning and 500.8MB in the end (delta: -401.7MB). Peak memory consumption was 290.1MB. Max. memory is 16.1GB. [2024-11-09 11:00:49,672 INFO L158 Benchmark]: Witness Printer took 4.29ms. Allocated memory is still 851.4MB. Free memory is still 500.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:00:49,673 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 96.5MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.19ms. Allocated memory is still 161.5MB. Free memory was 101.3MB in the beginning and 123.5MB in the end (delta: -22.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.00ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.82ms. Allocated memory is still 161.5MB. Free memory was 121.4MB in the beginning and 119.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 510.63ms. Allocated memory is still 161.5MB. Free memory was 119.3MB in the beginning and 99.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 59872.72ms. Allocated memory was 161.5MB in the beginning and 851.4MB in the end (delta: 690.0MB). Free memory was 99.1MB in the beginning and 500.8MB in the end (delta: -401.7MB). Peak memory consumption was 290.1MB. Max. memory is 16.1GB. * Witness Printer took 4.29ms. Allocated memory is still 851.4MB. Free memory is still 500.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; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=100, limit=0, t1=-2] [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0, t1=-2, t2=-1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L752] 2 __assert_fail ("0", "generated/unwind1.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] - UnprovableResult [Line: 771]: 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: 776]: 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, 43 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: 59.6s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7934 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7925 mSDsluCounter, 491 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 487 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3916 IncrementalHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 4 mSDtfsCounter, 3916 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1016 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 900 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51510 ImplicationChecksByTransitivity, 43.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960occurred in iteration=8, InterpolantAutomatonStates: 353, 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.4s SatisfiabilityAnalysisTime, 33.1s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 762 ConstructedInterpolants, 0 QuantifiedInterpolants, 3633 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1009 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 7/17596 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-09 11:00:49,706 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/unwind1-100.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 d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:00:51,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:00:51,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 11:00:51,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:00:51,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:00:51,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:00:51,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:00:51,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:00:51,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:00:51,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:00:51,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:00:51,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:00:51,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:00:51,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:00:51,970 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:00:51,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:00:51,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:00:51,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:00:51,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:00:51,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:00:51,975 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 11:00:51,975 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 11:00:51,975 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 11:00:51,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:00:51,976 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 11:00:51,976 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 11:00:51,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:00:51,976 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 11:00:51,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:00:51,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:00:51,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:00:51,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:00:51,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:00:51,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:00:51,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:00:51,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:00:51,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:00:51,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:00:51,987 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 11:00:51,987 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 11:00:51,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:00:51,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:00:51,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:00:51,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:00:51,988 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 -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2024-11-09 11:00:52,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:00:52,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:00:52,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:00:52,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:00:52,294 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:00:52,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-09 11:00:53,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:00:54,049 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:00:54,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-09 11:00:54,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b9d5f2f/fefa92300e92494da55b6fb05edbfdff/FLAGbb989178a [2024-11-09 11:00:54,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b9d5f2f/fefa92300e92494da55b6fb05edbfdff [2024-11-09 11:00:54,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:00:54,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:00:54,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:00:54,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:00:54,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:00:54,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4f848a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54, skipping insertion in model container [2024-11-09 11:00:54,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:00:54,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:00:54,509 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:00:54,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:00:54,598 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:00:54,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54 WrapperNode [2024-11-09 11:00:54,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:00:54,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:00:54,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:00:54,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:00:54,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,648 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 57 [2024-11-09 11:00:54,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:00:54,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:00:54,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:00:54,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:00:54,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,697 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-09 11:00:54,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:00:54,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:00:54,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:00:54,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:00:54,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (1/1) ... [2024-11-09 11:00:54,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:00:54,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:00:54,755 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-09 11:00:54,760 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-09 11:00:54,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:00:54,804 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-09 11:00:54,804 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-09 11:00:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-09 11:00:54,805 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-09 11:00:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 11:00:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:00:54,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:00:54,806 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 11:00:54,977 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:00:54,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:00:55,122 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 11:00:55,122 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:00:55,271 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:00:55,272 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:00:55,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:00:55 BoogieIcfgContainer [2024-11-09 11:00:55,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:00:55,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:00:55,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:00:55,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:00:55,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:00:54" (1/3) ... [2024-11-09 11:00:55,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126d12ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:00:55, skipping insertion in model container [2024-11-09 11:00:55,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:54" (2/3) ... [2024-11-09 11:00:55,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126d12ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:00:55, skipping insertion in model container [2024-11-09 11:00:55,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:00:55" (3/3) ... [2024-11-09 11:00:55,283 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-09 11:00:55,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:00:55,298 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 11:00:55,298 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 11:00:55,346 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 11:00:55,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-11-09 11:00:55,408 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-09 11:00:55,412 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 11:00:55,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-11-09 11:00:55,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-11-09 11:00:55,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2024-11-09 11:00:55,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:00:55,437 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;@5a726da5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:00:55,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 11:00:55,446 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 11:00:55,447 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2024-11-09 11:00:55,447 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 11:00:55,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:55,448 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:55,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 11:00:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1073741351, now seen corresponding path program 1 times [2024-11-09 11:00:55,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:55,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065811460] [2024-11-09 11:00:55,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:55,467 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-09 11:00:55,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:55,470 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-09 11:00:55,471 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-09 11:00:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:55,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:00:55,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:55,680 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-09 11:00:55,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:00:55,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065811460] [2024-11-09 11:00:55,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065811460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:00:55,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:00:55,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:00:55,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175742580] [2024-11-09 11:00:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:00:55,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:00:55,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:55,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:00:55,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:00:55,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-09 11:00:55,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-09 11:00:55,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:55,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-09 11:00:55,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:55,936 INFO L124 PetriNetUnfolderBase]: 124/273 cut-off events. [2024-11-09 11:00:55,937 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 11:00:55,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 273 events. 124/273 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1167 event pairs, 68 based on Foata normal form. 33/265 useless extension candidates. Maximal degree in co-relation 460. Up to 146 conditions per place. [2024-11-09 11:00:55,944 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 27 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-11-09 11:00:55,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 163 flow [2024-11-09 11:00:55,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:00:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 11:00:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-11-09 11:00:55,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-11-09 11:00:55,957 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 5 states and 80 transitions. [2024-11-09 11:00:55,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 163 flow [2024-11-09 11:00:55,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 149 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 11:00:55,962 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 80 flow [2024-11-09 11:00:55,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2024-11-09 11:00:55,969 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-11-09 11:00:55,969 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 80 flow [2024-11-09 11:00:55,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-09 11:00:55,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:55,969 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:55,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:00:56,170 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-09 11:00:56,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 11:00:56,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1072770645, now seen corresponding path program 1 times [2024-11-09 11:00:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:56,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489782226] [2024-11-09 11:00:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:56,172 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-09 11:00:56,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:56,175 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-09 11:00:56,176 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-09 11:00:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:56,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:00:56,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:56,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:00:56,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:56,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489782226] [2024-11-09 11:00:56,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489782226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:00:56,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:00:56,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:00:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49071059] [2024-11-09 11:00:56,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:00:56,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:00:56,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:00:56,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:00:56,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-09 11:00:56,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-09 11:00:56,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:56,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-09 11:00:56,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:56,453 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2024-11-09 11:00:56,453 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-09 11:00:56,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 247 events. 111/247 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 934 event pairs, 30 based on Foata normal form. 13/245 useless extension candidates. Maximal degree in co-relation 260. Up to 97 conditions per place. [2024-11-09 11:00:56,458 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2024-11-09 11:00:56,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 216 flow [2024-11-09 11:00:56,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:00:56,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 11:00:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-11-09 11:00:56,460 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2024-11-09 11:00:56,460 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 80 flow. Second operand 5 states and 73 transitions. [2024-11-09 11:00:56,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 216 flow [2024-11-09 11:00:56,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 11:00:56,467 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 111 flow [2024-11-09 11:00:56,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2024-11-09 11:00:56,468 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2024-11-09 11:00:56,468 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 111 flow [2024-11-09 11:00:56,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-09 11:00:56,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:56,468 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:56,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 11:00:56,675 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-09 11:00:56,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 11:00:56,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1251716570, now seen corresponding path program 1 times [2024-11-09 11:00:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:56,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371127508] [2024-11-09 11:00:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:56,676 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-09 11:00:56,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:56,678 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-09 11:00:56,679 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-09 11:00:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:56,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:00:56,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:56,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:00:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:56,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:56,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371127508] [2024-11-09 11:00:56,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371127508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:00:56,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:00:56,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-09 11:00:56,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551885951] [2024-11-09 11:00:56,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:00:56,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:00:56,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:56,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:00:56,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:00:56,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-09 11:00:56,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-09 11:00:56,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:56,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-09 11:00:56,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:57,323 INFO L124 PetriNetUnfolderBase]: 163/372 cut-off events. [2024-11-09 11:00:57,323 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2024-11-09 11:00:57,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 372 events. 163/372 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1626 event pairs, 63 based on Foata normal form. 10/362 useless extension candidates. Maximal degree in co-relation 554. Up to 93 conditions per place. [2024-11-09 11:00:57,327 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 52 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2024-11-09 11:00:57,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 375 flow [2024-11-09 11:00:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 11:00:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 11:00:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-11-09 11:00:57,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.445141065830721 [2024-11-09 11:00:57,330 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 111 flow. Second operand 11 states and 142 transitions. [2024-11-09 11:00:57,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 375 flow [2024-11-09 11:00:57,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 11:00:57,336 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 196 flow [2024-11-09 11:00:57,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2024-11-09 11:00:57,337 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-11-09 11:00:57,338 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 196 flow [2024-11-09 11:00:57,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-09 11:00:57,338 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:57,338 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:57,343 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-09 11:00:57,539 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-09 11:00:57,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 11:00:57,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash 82878036, now seen corresponding path program 1 times [2024-11-09 11:00:57,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:57,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350427781] [2024-11-09 11:00:57,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:57,544 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-09 11:00:57,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:57,546 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-09 11:00:57,548 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-09 11:00:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:57,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:00:57,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:57,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:00:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:57,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:57,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350427781] [2024-11-09 11:00:57,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350427781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:00:57,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:00:57,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-09 11:00:57,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697082408] [2024-11-09 11:00:57,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:00:57,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:00:57,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:57,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:00:57,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:00:57,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-09 11:00:57,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 196 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-09 11:00:57,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:57,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-09 11:00:57,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:58,424 INFO L124 PetriNetUnfolderBase]: 183/412 cut-off events. [2024-11-09 11:00:58,424 INFO L125 PetriNetUnfolderBase]: For 587/587 co-relation queries the response was YES. [2024-11-09 11:00:58,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 412 events. 183/412 cut-off events. For 587/587 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1735 event pairs, 66 based on Foata normal form. 20/422 useless extension candidates. Maximal degree in co-relation 925. Up to 103 conditions per place. [2024-11-09 11:00:58,427 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 62 selfloop transitions, 16 changer transitions 0/83 dead transitions. [2024-11-09 11:00:58,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 513 flow [2024-11-09 11:00:58,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:00:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 11:00:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 173 transitions. [2024-11-09 11:00:58,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42610837438423643 [2024-11-09 11:00:58,430 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 196 flow. Second operand 14 states and 173 transitions. [2024-11-09 11:00:58,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 513 flow [2024-11-09 11:00:58,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 83 transitions, 466 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-11-09 11:00:58,436 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 223 flow [2024-11-09 11:00:58,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=223, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2024-11-09 11:00:58,437 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2024-11-09 11:00:58,437 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 223 flow [2024-11-09 11:00:58,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-09 11:00:58,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:58,438 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:58,442 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-09 11:00:58,638 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-09 11:00:58,638 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-09 11:00:58,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:58,639 INFO L85 PathProgramCache]: Analyzing trace with hash 3331892, now seen corresponding path program 2 times [2024-11-09 11:00:58,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:58,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020098479] [2024-11-09 11:00:58,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:00:58,640 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-09 11:00:58,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:58,642 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-09 11:00:58,643 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-09 11:00:58,694 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:00:58,694 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:00:58,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:00:58,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:58,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:00:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:58,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:58,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020098479] [2024-11-09 11:00:58,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020098479] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:00:58,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:00:58,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-09 11:00:58,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009084772] [2024-11-09 11:00:58,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:00:58,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 11:00:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 11:00:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-09 11:00:59,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 11:00:59,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 223 flow. Second operand has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 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-09 11:00:59,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:59,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 11:00:59,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:59,757 INFO L124 PetriNetUnfolderBase]: 391/846 cut-off events. [2024-11-09 11:00:59,757 INFO L125 PetriNetUnfolderBase]: For 2081/2089 co-relation queries the response was YES. [2024-11-09 11:00:59,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2712 conditions, 846 events. 391/846 cut-off events. For 2081/2089 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4100 event pairs, 61 based on Foata normal form. 58/888 useless extension candidates. Maximal degree in co-relation 1995. Up to 165 conditions per place. [2024-11-09 11:00:59,762 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 88 selfloop transitions, 40 changer transitions 0/136 dead transitions. [2024-11-09 11:00:59,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 136 transitions, 864 flow [2024-11-09 11:00:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 11:00:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-09 11:00:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 289 transitions. [2024-11-09 11:00:59,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4745484400656814 [2024-11-09 11:00:59,765 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 223 flow. Second operand 21 states and 289 transitions. [2024-11-09 11:00:59,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 136 transitions, 864 flow [2024-11-09 11:00:59,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 136 transitions, 806 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-11-09 11:00:59,772 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 499 flow [2024-11-09 11:00:59,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=499, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2024-11-09 11:00:59,773 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2024-11-09 11:00:59,773 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 499 flow [2024-11-09 11:00:59,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 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-09 11:00:59,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:59,774 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:59,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 11:00:59,974 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-09 11:00:59,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 11:00:59,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:59,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1250730172, now seen corresponding path program 1 times [2024-11-09 11:00:59,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:59,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685468063] [2024-11-09 11:00:59,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:59,976 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-09 11:00:59,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:59,978 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-09 11:00:59,979 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-09 11:01:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:01:00,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 11:01:00,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:01:00,048 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-09 11:01:00,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:01:00,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:01:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685468063] [2024-11-09 11:01:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685468063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:01:00,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:01:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 11:01:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557328333] [2024-11-09 11:01:00,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:01:00,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:01:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:01:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:01:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:01:00,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 11:01:00,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-09 11:01:00,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:01:00,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 11:01:00,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:01:00,145 INFO L124 PetriNetUnfolderBase]: 313/752 cut-off events. [2024-11-09 11:01:00,145 INFO L125 PetriNetUnfolderBase]: For 2972/2972 co-relation queries the response was YES. [2024-11-09 11:01:00,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 752 events. 313/752 cut-off events. For 2972/2972 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3893 event pairs, 303 based on Foata normal form. 14/748 useless extension candidates. Maximal degree in co-relation 2559. Up to 636 conditions per place. [2024-11-09 11:01:00,149 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 35 selfloop transitions, 1 changer transitions 21/62 dead transitions. [2024-11-09 11:01:00,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 62 transitions, 603 flow [2024-11-09 11:01:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:01:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 11:01:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-09 11:01:00,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2024-11-09 11:01:00,150 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 499 flow. Second operand 3 states and 41 transitions. [2024-11-09 11:01:00,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 62 transitions, 603 flow [2024-11-09 11:01:00,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 402 flow, removed 80 selfloop flow, removed 13 redundant places. [2024-11-09 11:01:00,163 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 189 flow [2024-11-09 11:01:00,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2024-11-09 11:01:00,164 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2024-11-09 11:01:00,164 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 189 flow [2024-11-09 11:01:00,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-09 11:01:00,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:01:00,164 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:01:00,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 11:01:00,367 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-09 11:01:00,367 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-09 11:01:00,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:01:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1120744820, now seen corresponding path program 3 times [2024-11-09 11:01:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:01:00,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475651339] [2024-11-09 11:01:00,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:01:00,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:01:00,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:01:00,371 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-09 11:01:00,372 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-09 11:01:00,416 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 11:01:00,416 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:01:00,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:01:00,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:01:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 11:01:00,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:01:00,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:01:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475651339] [2024-11-09 11:01:00,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475651339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:01:00,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:01:00,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:01:00,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788455283] [2024-11-09 11:01:00,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:01:00,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:01:00,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:01:00,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:01:00,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:01:00,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-09 11:01:00,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 41 transitions, 189 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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-09 11:01:00,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:01:00,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-09 11:01:00,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:01:00,703 INFO L124 PetriNetUnfolderBase]: 156/336 cut-off events. [2024-11-09 11:01:00,703 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2024-11-09 11:01:00,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 336 events. 156/336 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1118 event pairs, 80 based on Foata normal form. 5/337 useless extension candidates. Maximal degree in co-relation 922. Up to 176 conditions per place. [2024-11-09 11:01:00,705 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 23 selfloop transitions, 1 changer transitions 26/53 dead transitions. [2024-11-09 11:01:00,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 319 flow [2024-11-09 11:01:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:01:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 11:01:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2024-11-09 11:01:00,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41954022988505746 [2024-11-09 11:01:00,707 INFO L175 Difference]: Start difference. First operand has 68 places, 41 transitions, 189 flow. Second operand 6 states and 73 transitions. [2024-11-09 11:01:00,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 319 flow [2024-11-09 11:01:00,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 263 flow, removed 17 selfloop flow, removed 15 redundant places. [2024-11-09 11:01:00,708 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 90 flow [2024-11-09 11:01:00,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2024-11-09 11:01:00,709 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2024-11-09 11:01:00,709 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 90 flow [2024-11-09 11:01:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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-09 11:01:00,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:01:00,709 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:01:00,714 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-09 11:01:00,910 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-09 11:01:00,910 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-09 11:01:00,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:01:00,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1963520340, now seen corresponding path program 2 times [2024-11-09 11:01:00,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:01:00,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146178251] [2024-11-09 11:01:00,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:01:00,911 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-09 11:01:00,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:01:00,914 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-09 11:01:00,914 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-09 11:01:00,959 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:01:00,959 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:01:00,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 11:01:00,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:01:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:01:01,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:01:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:01:01,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:01:01,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146178251] [2024-11-09 11:01:01,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146178251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:01:01,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:01:01,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-11-09 11:01:01,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397393813] [2024-11-09 11:01:01,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:01:01,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 11:01:01,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:01:01,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 11:01:01,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2024-11-09 11:01:02,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 11:01:02,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 90 flow. Second operand has 28 states, 28 states have (on average 9.357142857142858) internal successors, (262), 28 states have internal predecessors, (262), 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-09 11:01:02,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:01:02,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 11:01:02,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:01:03,946 INFO L124 PetriNetUnfolderBase]: 264/545 cut-off events. [2024-11-09 11:01:03,946 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-11-09 11:01:03,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 545 events. 264/545 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1869 event pairs, 24 based on Foata normal form. 60/603 useless extension candidates. Maximal degree in co-relation 1453. Up to 136 conditions per place. [2024-11-09 11:01:03,948 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 77 selfloop transitions, 24 changer transitions 64/168 dead transitions. [2024-11-09 11:01:03,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 168 transitions, 857 flow [2024-11-09 11:01:03,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 11:01:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2024-11-09 11:01:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 481 transitions. [2024-11-09 11:01:03,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4364791288566243 [2024-11-09 11:01:03,951 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 90 flow. Second operand 38 states and 481 transitions. [2024-11-09 11:01:03,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 168 transitions, 857 flow [2024-11-09 11:01:03,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 168 transitions, 816 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-11-09 11:01:03,955 INFO L231 Difference]: Finished difference. Result has 95 places, 38 transitions, 263 flow [2024-11-09 11:01:03,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=263, PETRI_PLACES=95, PETRI_TRANSITIONS=38} [2024-11-09 11:01:03,955 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2024-11-09 11:01:03,955 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 38 transitions, 263 flow [2024-11-09 11:01:03,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.357142857142858) internal successors, (262), 28 states have internal predecessors, (262), 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-09 11:01:03,956 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:01:03,956 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:01:03,960 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 (9)] Forceful destruction successful, exit code 0 [2024-11-09 11:01:04,156 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-09 11:01:04,157 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-09 11:01:04,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:01:04,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1880608212, now seen corresponding path program 3 times [2024-11-09 11:01:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:01:04,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060840239] [2024-11-09 11:01:04,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:01:04,158 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-09 11:01:04,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:01:04,161 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-09 11:01:04,161 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-09 11:01:04,227 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-09 11:01:04,227 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:01:04,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 11:01:04,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:01:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:01:04,932 INFO L311 TraceCheckSpWp]: Computing backward predicates...