./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-1.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-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 369675afdce9f24a16d648c2af0379dafe84b15f75fb11d38697f731d0b5b69e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:59:35,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:59:35,495 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:35,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:59:35,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:59:35,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:59:35,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:59:35,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:59:35,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:59:35,528 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:59:35,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:59:35,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:59:35,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:59:35,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:59:35,533 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:59:35,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:59:35,533 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:59:35,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:59:35,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:59:35,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:59:35,534 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:59:35,534 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:59:35,535 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:59:35,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:59:35,535 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:59:35,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:59:35,536 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:59:35,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:59:35,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:59:35,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:59:35,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:59:35,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:59:35,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:59:35,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:59:35,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:59:35,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:59:35,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:59:35,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:59:35,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:59:35,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:59:35,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:59:35,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:59:35,539 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 -> 369675afdce9f24a16d648c2af0379dafe84b15f75fb11d38697f731d0b5b69e [2024-11-09 10:59:35,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:59:35,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:59:35,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:59:35,757 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:59:35,758 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:59:35,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-1.i [2024-11-09 10:59:36,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:59:37,171 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:59:37,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-1.i [2024-11-09 10:59:37,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b57882b/f7a61fb2930746e5befb575c6b9f23ab/FLAG6eecc4474 [2024-11-09 10:59:37,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b57882b/f7a61fb2930746e5befb575c6b9f23ab [2024-11-09 10:59:37,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:59:37,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:59:37,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:59:37,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:59:37,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:59:37,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:59:37" (1/1) ... [2024-11-09 10:59:37,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de09a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:37, skipping insertion in model container [2024-11-09 10:59:37,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:59:37" (1/1) ... [2024-11-09 10:59:37,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:59:37,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:59:37,498 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:59:37,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:59:37,571 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:59:37,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:37 WrapperNode [2024-11-09 10:59:37,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:59:37,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:59:37,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:59:37,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:59:37,578 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:37" (1/1) ... [2024-11-09 10:59:37,591 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:37" (1/1) ... [2024-11-09 10:59:37,609 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 56 [2024-11-09 10:59:37,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:59:37,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:59:37,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:59:37,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:59:37,618 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:37" (1/1) ... [2024-11-09 10:59:37,618 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:37" (1/1) ... [2024-11-09 10:59:37,621 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:37" (1/1) ... [2024-11-09 10:59:37,642 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:37,642 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:37" (1/1) ... [2024-11-09 10:59:37,643 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:37" (1/1) ... [2024-11-09 10:59:37,646 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:37" (1/1) ... [2024-11-09 10:59:37,651 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:37" (1/1) ... [2024-11-09 10:59:37,654 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:37" (1/1) ... [2024-11-09 10:59:37,655 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:37" (1/1) ... [2024-11-09 10:59:37,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:59:37,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:59:37,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:59:37,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:59:37,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:37" (1/1) ... [2024-11-09 10:59:37,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:59:37,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:37,692 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:37,694 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:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:59:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-09 10:59:37,731 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-09 10:59:37,731 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-09 10:59:37,731 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-09 10:59:37,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:59:37,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:59:37,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:59:37,732 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:37,832 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:59:37,834 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:59:37,926 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:59:37,926 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:59:37,991 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:59:37,991 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 10:59:37,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:37 BoogieIcfgContainer [2024-11-09 10:59:37,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:59:37,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:59:37,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:59:37,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:59:37,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:59:37" (1/3) ... [2024-11-09 10:59:37,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7cdbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:59:37, skipping insertion in model container [2024-11-09 10:59:37,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:37" (2/3) ... [2024-11-09 10:59:37,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7cdbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:59:37, skipping insertion in model container [2024-11-09 10:59:37,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:37" (3/3) ... [2024-11-09 10:59:37,998 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-1.i [2024-11-09 10:59:38,011 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:59:38,012 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:59:38,012 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:59:38,044 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:59:38,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-11-09 10:59:38,093 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-09 10:59:38,093 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:59:38,096 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:38,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-11-09 10:59:38,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2024-11-09 10:59:38,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:59:38,110 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;@5bd10edb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:59:38,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 10:59:38,120 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:59:38,120 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2024-11-09 10:59:38,120 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:59:38,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:38,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:38,122 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:38,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:38,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1073741351, now seen corresponding path program 1 times [2024-11-09 10:59:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:38,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072560572] [2024-11-09 10:59:38,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:38,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:38,524 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:38,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:38,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072560572] [2024-11-09 10:59:38,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072560572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:38,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:38,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:59:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117328384] [2024-11-09 10:59:38,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:38,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:59:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:38,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:59:38,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:59:38,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:59:38,580 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:38,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:38,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:59:38,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:38,730 INFO L124 PetriNetUnfolderBase]: 152/302 cut-off events. [2024-11-09 10:59:38,731 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-09 10:59:38,733 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:38,736 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 33 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2024-11-09 10:59:38,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 196 flow [2024-11-09 10:59:38,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:59:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:59:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-11-09 10:59:38,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2024-11-09 10:59:38,748 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:38,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 196 flow [2024-11-09 10:59:38,750 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:38,753 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 91 flow [2024-11-09 10:59:38,754 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:38,758 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2024-11-09 10:59:38,758 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 91 flow [2024-11-09 10:59:38,758 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:38,759 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:38,759 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:38,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:59:38,760 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:38,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:38,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1072770645, now seen corresponding path program 1 times [2024-11-09 10:59:38,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:38,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565905867] [2024-11-09 10:59:38,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:38,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:38,834 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:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:38,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565905867] [2024-11-09 10:59:38,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565905867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:38,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:38,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:59:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548292846] [2024-11-09 10:59:38,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:38,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:59:38,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:38,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:59:38,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:59:38,839 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-09 10:59:38,840 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:38,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:38,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-09 10:59:38,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:38,930 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2024-11-09 10:59:38,931 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2024-11-09 10:59:38,932 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:38,935 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2024-11-09 10:59:38,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 228 flow [2024-11-09 10:59:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:59:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:59:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-11-09 10:59:38,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2024-11-09 10:59:38,936 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:38,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 228 flow [2024-11-09 10:59:38,938 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:38,938 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 127 flow [2024-11-09 10:59:38,939 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:38,939 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-11-09 10:59:38,939 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 127 flow [2024-11-09 10:59:38,942 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:38,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:38,943 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:38,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:59:38,943 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:38,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1251716570, now seen corresponding path program 1 times [2024-11-09 10:59:38,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:38,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805061441] [2024-11-09 10:59:38,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:38,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:39,040 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:39,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:39,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805061441] [2024-11-09 10:59:39,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805061441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:39,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43926502] [2024-11-09 10:59:39,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:39,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:39,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:39,044 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:39,046 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:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:39,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:59:39,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:39,211 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:39,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:39,250 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:39,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43926502] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:39,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:59:39,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-09 10:59:39,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846803273] [2024-11-09 10:59:39,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:39,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:59:39,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:39,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:59:39,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:59:39,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:59:39,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 127 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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:39,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:39,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:59:39,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:39,426 INFO L124 PetriNetUnfolderBase]: 140/298 cut-off events. [2024-11-09 10:59:39,427 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-11-09 10:59:39,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 298 events. 140/298 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1158 event pairs, 35 based on Foata normal form. 5/279 useless extension candidates. Maximal degree in co-relation 465. Up to 80 conditions per place. [2024-11-09 10:59:39,429 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 38 selfloop transitions, 11 changer transitions 0/57 dead transitions. [2024-11-09 10:59:39,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 296 flow [2024-11-09 10:59:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:59:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:59:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-11-09 10:59:39,431 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2024-11-09 10:59:39,431 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 127 flow. Second operand 8 states and 113 transitions. [2024-11-09 10:59:39,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 296 flow [2024-11-09 10:59:39,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:39,434 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 184 flow [2024-11-09 10:59:39,434 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=184, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2024-11-09 10:59:39,435 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2024-11-09 10:59:39,435 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 184 flow [2024-11-09 10:59:39,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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:39,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:39,435 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:39,457 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:39,636 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:39,636 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:39,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash 147522164, now seen corresponding path program 2 times [2024-11-09 10:59:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:39,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651879740] [2024-11-09 10:59:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:39,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:39,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651879740] [2024-11-09 10:59:39,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651879740] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:39,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666626978] [2024-11-09 10:59:39,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:59:39,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:39,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:39,702 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:39,703 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:39,756 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:59:39,757 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:59:39,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:59:39,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:39,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:59:39,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666626978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:39,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 10:59:39,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 10:59:39,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506416385] [2024-11-09 10:59:39,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:39,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:59:39,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:39,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:59:39,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:59:39,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-09 10:59:39,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:39,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:39,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-09 10:59:39,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:39,946 INFO L124 PetriNetUnfolderBase]: 168/400 cut-off events. [2024-11-09 10:59:39,947 INFO L125 PetriNetUnfolderBase]: For 584/584 co-relation queries the response was YES. [2024-11-09 10:59:39,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 400 events. 168/400 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1928 event pairs, 55 based on Foata normal form. 5/390 useless extension candidates. Maximal degree in co-relation 1058. Up to 123 conditions per place. [2024-11-09 10:59:39,950 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 49 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2024-11-09 10:59:39,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 415 flow [2024-11-09 10:59:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:59:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:59:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-11-09 10:59:39,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2024-11-09 10:59:39,953 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 184 flow. Second operand 7 states and 98 transitions. [2024-11-09 10:59:39,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 415 flow [2024-11-09 10:59:39,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 391 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-09 10:59:39,959 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 221 flow [2024-11-09 10:59:39,959 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2024-11-09 10:59:39,961 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-11-09 10:59:39,961 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 221 flow [2024-11-09 10:59:39,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:39,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:39,961 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:39,974 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:40,165 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:40,166 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 10:59:40,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash 82878036, now seen corresponding path program 1 times [2024-11-09 10:59:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:40,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941362866] [2024-11-09 10:59:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:40,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:59:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:40,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:59:40,194 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:59:40,195 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-09 10:59:40,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-09 10:59:40,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-09 10:59:40,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-09 10:59:40,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-09 10:59:40,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:59:40,197 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-09 10:59:40,228 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:59:40,228 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:59:40,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:59:40 BasicIcfg [2024-11-09 10:59:40,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:59:40,235 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:59:40,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:59:40,236 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:59:40,236 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:37" (3/4) ... [2024-11-09 10:59:40,239 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:59:40,241 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:59:40,241 INFO L158 Benchmark]: Toolchain (without parser) took 3037.00ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 121.2MB in the beginning and 174.0MB in the end (delta: -52.8MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2024-11-09 10:59:40,241 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:59:40,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.07ms. Allocated memory is still 176.2MB. Free memory was 121.2MB in the beginning and 98.8MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 10:59:40,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.79ms. Allocated memory is still 176.2MB. Free memory was 98.8MB in the beginning and 96.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:59:40,243 INFO L158 Benchmark]: Boogie Preprocessor took 49.70ms. Allocated memory is still 176.2MB. Free memory was 96.6MB in the beginning and 94.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:59:40,243 INFO L158 Benchmark]: RCFGBuilder took 331.15ms. Allocated memory is still 176.2MB. Free memory was 94.5MB in the beginning and 74.4MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 10:59:40,243 INFO L158 Benchmark]: TraceAbstraction took 2241.57ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 73.6MB in the beginning and 174.0MB in the end (delta: -100.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:59:40,244 INFO L158 Benchmark]: Witness Printer took 5.40ms. Allocated memory is still 272.6MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:59:40,245 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.14ms. Allocated memory is still 176.2MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.07ms. Allocated memory is still 176.2MB. Free memory was 121.2MB in the beginning and 98.8MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.79ms. Allocated memory is still 176.2MB. Free memory was 98.8MB in the beginning and 96.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.70ms. Allocated memory is still 176.2MB. Free memory was 96.6MB in the beginning and 94.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.15ms. Allocated memory is still 176.2MB. Free memory was 94.5MB in the beginning and 74.4MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2241.57ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 73.6MB in the beginning and 174.0MB in the end (delta: -100.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.40ms. Allocated memory is still 272.6MB. Free memory is still 174.0MB. 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 = 1 [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=1, limit=0, t1=-2] [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, 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=1, arg={0:0}, limit=2] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, limit=2] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, limit=2] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, limit=2] [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=1, arg={0:0}, limit=2] [L752] 2 __assert_fail ("0", "generated/unwind1.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, limit=2] - 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: 2.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 401 IncrementalHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 2 mSDtfsCounter, 401 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=4, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 229 SizeOfPredicates, 5 NumberOfNonLiveVariables, 167 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6/10 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 10:59:40,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 369675afdce9f24a16d648c2af0379dafe84b15f75fb11d38697f731d0b5b69e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:59:42,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:59:42,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:59:42,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:59:42,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:59:42,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:59:42,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:59:42,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:59:42,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:59:42,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:59:42,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:59:42,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:59:42,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:59:42,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:59:42,118 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:59:42,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:59:42,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:59:42,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:59:42,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:59:42,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:59:42,120 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:59:42,123 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:59:42,124 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:59:42,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:59:42,124 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:59:42,124 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:59:42,124 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:59:42,124 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:59:42,125 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:59:42,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:59:42,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:59:42,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:59:42,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:59:42,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:59:42,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:59:42,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:59:42,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:59:42,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:59:42,126 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:59:42,127 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:59:42,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:59:42,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:59:42,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:59:42,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:59:42,130 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 -> 369675afdce9f24a16d648c2af0379dafe84b15f75fb11d38697f731d0b5b69e [2024-11-09 10:59:42,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:59:42,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:59:42,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:59:42,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:59:42,400 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:59:42,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-1.i [2024-11-09 10:59:43,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:59:43,870 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:59:43,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-1.i [2024-11-09 10:59:43,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d22c9a62/cf6cdf6cadf14b3c99381fe86b8519d6/FLAG0ac75701d [2024-11-09 10:59:43,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d22c9a62/cf6cdf6cadf14b3c99381fe86b8519d6 [2024-11-09 10:59:43,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:59:43,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:59:43,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:59:43,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:59:43,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:59:43,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:59:43" (1/1) ... [2024-11-09 10:59:43,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c60e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:43, skipping insertion in model container [2024-11-09 10:59:43,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:59:43" (1/1) ... [2024-11-09 10:59:43,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:59:44,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:59:44,265 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:59:44,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:59:44,340 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:59:44,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:44 WrapperNode [2024-11-09 10:59:44,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:59:44,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:59:44,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:59:44,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:59:44,346 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:44" (1/1) ... [2024-11-09 10:59:44,361 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:44" (1/1) ... [2024-11-09 10:59:44,378 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 57 [2024-11-09 10:59:44,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:59:44,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:59:44,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:59:44,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:59:44,389 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:44" (1/1) ... [2024-11-09 10:59:44,390 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:44" (1/1) ... [2024-11-09 10:59:44,393 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:44" (1/1) ... [2024-11-09 10:59:44,412 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:44,413 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:44" (1/1) ... [2024-11-09 10:59:44,413 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:44" (1/1) ... [2024-11-09 10:59:44,421 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:44" (1/1) ... [2024-11-09 10:59:44,423 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:44" (1/1) ... [2024-11-09 10:59:44,429 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:44" (1/1) ... [2024-11-09 10:59:44,430 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:44" (1/1) ... [2024-11-09 10:59:44,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:59:44,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:59:44,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:59:44,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:59:44,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:44" (1/1) ... [2024-11-09 10:59:44,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:59:44,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:44,461 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:44,463 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:44,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:59:44,498 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-09 10:59:44,498 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-09 10:59:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-09 10:59:44,499 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-09 10:59:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:59:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:59:44,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:59:44,500 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:44,644 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:59:44,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:59:44,800 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:59:44,802 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:59:44,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:59:44,912 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 10:59:44,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:44 BoogieIcfgContainer [2024-11-09 10:59:44,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:59:44,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:59:44,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:59:44,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:59:44,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:59:43" (1/3) ... [2024-11-09 10:59:44,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c75467f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:59:44, skipping insertion in model container [2024-11-09 10:59:44,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:44" (2/3) ... [2024-11-09 10:59:44,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c75467f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:59:44, skipping insertion in model container [2024-11-09 10:59:44,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:44" (3/3) ... [2024-11-09 10:59:44,920 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-1.i [2024-11-09 10:59:44,935 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:59:44,935 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:59:44,936 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:59:44,983 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:59:45,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-11-09 10:59:45,036 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-09 10:59:45,036 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:59:45,040 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:45,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-11-09 10:59:45,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2024-11-09 10:59:45,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:59:45,059 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;@4ea4b519, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:59:45,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 10:59:45,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:59:45,066 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2024-11-09 10:59:45,066 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:59:45,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:45,067 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:45,068 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:45,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1073741351, now seen corresponding path program 1 times [2024-11-09 10:59:45,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:59:45,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485521496] [2024-11-09 10:59:45,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:45,084 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 10:59:45,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:59:45,087 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 10:59:45,107 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 10:59:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:45,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:59:45,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:45,265 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:45,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:59:45,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:59:45,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485521496] [2024-11-09 10:59:45,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485521496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:45,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:45,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:59:45,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608261396] [2024-11-09 10:59:45,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:45,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:59:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:59:45,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:59:45,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:59:45,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-09 10:59:45,314 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 10:59:45,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:45,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-09 10:59:45,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:45,442 INFO L124 PetriNetUnfolderBase]: 124/273 cut-off events. [2024-11-09 10:59:45,442 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 10:59:45,443 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 10:59:45,448 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 27 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-11-09 10:59:45,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 163 flow [2024-11-09 10:59:45,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:59:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:59:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-11-09 10:59:45,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-11-09 10:59:45,460 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 5 states and 80 transitions. [2024-11-09 10:59:45,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 163 flow [2024-11-09 10:59:45,462 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 10:59:45,464 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 80 flow [2024-11-09 10:59:45,465 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 10:59:45,468 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-11-09 10:59:45,468 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 80 flow [2024-11-09 10:59:45,468 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 10:59:45,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:45,468 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:45,473 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 10:59:45,671 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 10:59:45,672 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:45,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1072770645, now seen corresponding path program 1 times [2024-11-09 10:59:45,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:59:45,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502161420] [2024-11-09 10:59:45,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:45,673 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 10:59:45,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:59:45,676 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 10:59:45,677 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 10:59:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:45,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:59:45,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:45,757 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:45,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:59:45,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:59:45,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502161420] [2024-11-09 10:59:45,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502161420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:45,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:45,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:59:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914076460] [2024-11-09 10:59:45,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:45,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:59:45,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:59:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:59:45,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:59:45,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-09 10:59:45,764 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 10:59:45,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:45,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-09 10:59:45,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:45,864 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2024-11-09 10:59:45,865 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-09 10:59:45,866 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 10:59:45,868 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2024-11-09 10:59:45,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 216 flow [2024-11-09 10:59:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:59:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:59:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-11-09 10:59:45,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2024-11-09 10:59:45,871 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 80 flow. Second operand 5 states and 73 transitions. [2024-11-09 10:59:45,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 216 flow [2024-11-09 10:59:45,873 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 10:59:45,875 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 111 flow [2024-11-09 10:59:45,875 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 10:59:45,876 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2024-11-09 10:59:45,876 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 111 flow [2024-11-09 10:59:45,876 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:45,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:45,877 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:45,881 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 10:59:46,077 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 10:59:46,077 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:46,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1251716570, now seen corresponding path program 1 times [2024-11-09 10:59:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:59:46,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155894754] [2024-11-09 10:59:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:46,082 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 10:59:46,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:59:46,084 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 10:59:46,085 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 10:59:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:46,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:59:46,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:46,190 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:46,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:46,249 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:46,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:59:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155894754] [2024-11-09 10:59:46,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155894754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:46,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:59:46,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-09 10:59:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232613385] [2024-11-09 10:59:46,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:46,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:59:46,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:59:46,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:59:46,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:59:46,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:59:46,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:46,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:46,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:59:46,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:46,498 INFO L124 PetriNetUnfolderBase]: 140/298 cut-off events. [2024-11-09 10:59:46,498 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-11-09 10:59:46,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 298 events. 140/298 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1163 event pairs, 35 based on Foata normal form. 5/279 useless extension candidates. Maximal degree in co-relation 407. Up to 80 conditions per place. [2024-11-09 10:59:46,501 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 38 selfloop transitions, 11 changer transitions 0/57 dead transitions. [2024-11-09 10:59:46,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 278 flow [2024-11-09 10:59:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:59:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:59:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-11-09 10:59:46,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2024-11-09 10:59:46,503 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 111 flow. Second operand 8 states and 113 transitions. [2024-11-09 10:59:46,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 278 flow [2024-11-09 10:59:46,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:59:46,505 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 164 flow [2024-11-09 10:59:46,505 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=164, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2024-11-09 10:59:46,505 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2024-11-09 10:59:46,506 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 164 flow [2024-11-09 10:59:46,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:46,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:46,506 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:46,510 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 10:59:46,706 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 10:59:46,707 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:46,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:46,707 INFO L85 PathProgramCache]: Analyzing trace with hash 147522164, now seen corresponding path program 2 times [2024-11-09 10:59:46,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:59:46,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535097531] [2024-11-09 10:59:46,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:59:46,708 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 10:59:46,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:59:46,709 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 10:59:46,710 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 10:59:46,750 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:59:46,751 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:59:46,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:59:46,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:46,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:46,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:59:46,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535097531] [2024-11-09 10:59:46,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535097531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:46,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:59:46,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-09 10:59:46,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355505787] [2024-11-09 10:59:46,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:46,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:59:46,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:59:46,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:59:46,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:59:46,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-09 10:59:46,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 164 flow. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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:46,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:46,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-09 10:59:46,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:47,300 INFO L124 PetriNetUnfolderBase]: 158/373 cut-off events. [2024-11-09 10:59:47,300 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2024-11-09 10:59:47,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 373 events. 158/373 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1728 event pairs, 18 based on Foata normal form. 10/368 useless extension candidates. Maximal degree in co-relation 937. Up to 73 conditions per place. [2024-11-09 10:59:47,304 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 63 selfloop transitions, 16 changer transitions 0/85 dead transitions. [2024-11-09 10:59:47,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 511 flow [2024-11-09 10:59:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:59:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 10:59:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 173 transitions. [2024-11-09 10:59:47,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42610837438423643 [2024-11-09 10:59:47,307 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 164 flow. Second operand 14 states and 173 transitions. [2024-11-09 10:59:47,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 511 flow [2024-11-09 10:59:47,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 477 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-09 10:59:47,312 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 251 flow [2024-11-09 10:59:47,312 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=251, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-11-09 10:59:47,313 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2024-11-09 10:59:47,313 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 251 flow [2024-11-09 10:59:47,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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:47,313 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:47,313 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:47,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:59:47,513 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 10:59:47,514 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 10:59:47,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:47,514 INFO L85 PathProgramCache]: Analyzing trace with hash 82878036, now seen corresponding path program 1 times [2024-11-09 10:59:47,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:59:47,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397359553] [2024-11-09 10:59:47,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:47,515 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 10:59:47,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:59:47,516 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 10:59:47,517 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 10:59:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:47,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:59:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:47,592 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:59:47,592 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:59:47,593 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-09 10:59:47,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-09 10:59:47,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-09 10:59:47,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-09 10:59:47,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-09 10:59:47,600 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 10:59:47,795 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 10:59:47,796 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-09 10:59:47,821 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:59:47,821 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:59:47,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:59:47 BasicIcfg [2024-11-09 10:59:47,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:59:47,826 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:59:47,826 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:59:47,826 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:59:47,826 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:44" (3/4) ... [2024-11-09 10:59:47,828 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:59:47,829 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:59:47,829 INFO L158 Benchmark]: Toolchain (without parser) took 3923.16ms. Allocated memory was 60.8MB in the beginning and 100.7MB in the end (delta: 39.8MB). Free memory was 37.1MB in the beginning and 72.7MB in the end (delta: -35.6MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-11-09 10:59:47,829 INFO L158 Benchmark]: CDTParser took 1.22ms. Allocated memory is still 60.8MB. Free memory was 37.6MB in the beginning and 37.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:59:47,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.28ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 36.9MB in the beginning and 51.5MB in the end (delta: -14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 10:59:47,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.88ms. Allocated memory is still 81.8MB. Free memory was 51.5MB in the beginning and 49.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:59:47,830 INFO L158 Benchmark]: Boogie Preprocessor took 55.81ms. Allocated memory is still 81.8MB. Free memory was 49.4MB in the beginning and 47.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:59:47,831 INFO L158 Benchmark]: RCFGBuilder took 477.73ms. Allocated memory is still 81.8MB. Free memory was 47.1MB in the beginning and 47.5MB in the end (delta: -356.1kB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-09 10:59:47,831 INFO L158 Benchmark]: TraceAbstraction took 2911.42ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 46.8MB in the beginning and 72.7MB in the end (delta: -25.9MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-11-09 10:59:47,831 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 100.7MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:59:47,833 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22ms. Allocated memory is still 60.8MB. Free memory was 37.6MB in the beginning and 37.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.28ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 36.9MB in the beginning and 51.5MB in the end (delta: -14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.88ms. Allocated memory is still 81.8MB. Free memory was 51.5MB in the beginning and 49.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.81ms. Allocated memory is still 81.8MB. Free memory was 49.4MB in the beginning and 47.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 477.73ms. Allocated memory is still 81.8MB. Free memory was 47.1MB in the beginning and 47.5MB in the end (delta: -356.1kB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2911.42ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 46.8MB in the beginning and 72.7MB in the end (delta: -25.9MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 100.7MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 1 [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=1, limit=0, t1=0] [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, limit=0, t1=0, t2=1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, limit=2] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, limit=2] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, limit=2] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, limit=2] [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=1, arg={0:0}, limit=2] [L752] 2 __assert_fail ("0", "generated/unwind1.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, limit=2] - 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: 2.8s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 623 IncrementalHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 2 mSDtfsCounter, 623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=4, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 203 SizeOfPredicates, 9 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 5/9 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 10:59:47,861 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample