./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-nondet.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind3-nondet.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 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:26:40,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:26:40,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:26:40,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:26:40,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:26:40,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:26:40,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:26:40,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:26:40,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:26:40,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:26:40,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:26:40,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:26:40,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:26:40,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:26:40,158 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:26:40,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:26:40,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:26:40,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:26:40,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:26:40,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:26:40,163 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:26:40,164 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:26:40,165 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:26:40,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:26:40,165 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:26:40,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:26:40,166 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:26:40,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:26:40,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:26:40,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:26:40,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:26:40,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:26:40,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:26:40,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:40,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:26:40,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:26:40,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:26:40,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:26:40,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:26:40,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:26:40,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:26:40,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:26:40,171 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 -> 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 [2024-11-10 18:26:40,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:26:40,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:26:40,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:26:40,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:26:40,454 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:26:40,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2024-11-10 18:26:41,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:26:42,305 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:26:42,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2024-11-10 18:26:42,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1a1df0d/f8bebe485e49435ea5fbd46994e6503b/FLAGb262ed123 [2024-11-10 18:26:42,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1a1df0d/f8bebe485e49435ea5fbd46994e6503b [2024-11-10 18:26:42,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:26:42,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:26:42,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:42,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:26:42,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:26:42,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:42,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161792a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42, skipping insertion in model container [2024-11-10 18:26:42,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:42,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:26:42,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:42,805 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:26:42,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:42,949 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:26:42,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42 WrapperNode [2024-11-10 18:26:42,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:42,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:42,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:26:42,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:26:42,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:42,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:43,017 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2024-11-10 18:26:43,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:43,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:26:43,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:26:43,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:26:43,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:43,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:43,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:43,052 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 18:26:43,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:43,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:43,058 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:43,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:43,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:43,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:43,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:26:43,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:26:43,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:26:43,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:26:43,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (1/1) ... [2024-11-10 18:26:43,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:43,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:43,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:26:43,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:26:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:26:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-10 18:26:43,181 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-10 18:26:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-10 18:26:43,181 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-10 18:26:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:26:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:26:43,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:26:43,183 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:26:43,348 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:26:43,350 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:26:43,522 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:26:43,522 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:26:43,650 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:26:43,650 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:26:43,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:43 BoogieIcfgContainer [2024-11-10 18:26:43,651 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:26:43,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:26:43,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:26:43,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:26:43,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:26:42" (1/3) ... [2024-11-10 18:26:43,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f11143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:43, skipping insertion in model container [2024-11-10 18:26:43,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:42" (2/3) ... [2024-11-10 18:26:43,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f11143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:43, skipping insertion in model container [2024-11-10 18:26:43,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:43" (3/3) ... [2024-11-10 18:26:43,665 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind3-nondet.i [2024-11-10 18:26:43,690 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:26:43,690 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 18:26:43,691 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:26:43,738 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:26:43,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 74 flow [2024-11-10 18:26:43,799 INFO L124 PetriNetUnfolderBase]: 10/55 cut-off events. [2024-11-10 18:26:43,800 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:43,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 55 events. 10/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 126 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2024-11-10 18:26:43,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 74 flow [2024-11-10 18:26:43,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 32 transitions, 71 flow [2024-11-10 18:26:43,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:26:43,825 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;@2f644750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:26:43,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 18:26:43,835 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:26:43,836 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-10 18:26:43,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:43,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:43,837 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:43,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:43,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1287863526, now seen corresponding path program 1 times [2024-11-10 18:26:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:43,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847009978] [2024-11-10 18:26:43,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:43,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:44,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:44,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847009978] [2024-11-10 18:26:44,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847009978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:44,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:44,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:26:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310554897] [2024-11-10 18:26:44,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:44,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:26:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:44,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:26:44,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:26:44,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-11-10 18:26:44,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 32 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:44,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:44,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-11-10 18:26:44,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:44,235 INFO L124 PetriNetUnfolderBase]: 109/261 cut-off events. [2024-11-10 18:26:44,237 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 18:26:44,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 261 events. 109/261 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1068 event pairs, 94 based on Foata normal form. 50/292 useless extension candidates. Maximal degree in co-relation 394. Up to 205 conditions per place. [2024-11-10 18:26:44,244 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 17 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2024-11-10 18:26:44,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 95 flow [2024-11-10 18:26:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:26:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:26:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2024-11-10 18:26:44,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-11-10 18:26:44,258 INFO L175 Difference]: Start difference. First operand has 33 places, 32 transitions, 71 flow. Second operand 2 states and 43 transitions. [2024-11-10 18:26:44,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 95 flow [2024-11-10 18:26:44,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:44,263 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 60 flow [2024-11-10 18:26:44,265 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-11-10 18:26:44,270 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2024-11-10 18:26:44,271 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 60 flow [2024-11-10 18:26:44,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:44,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:44,272 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:44,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:26:44,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:44,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:44,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1257655724, now seen corresponding path program 1 times [2024-11-10 18:26:44,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:44,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533944036] [2024-11-10 18:26:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:44,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:44,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533944036] [2024-11-10 18:26:44,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533944036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:44,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:44,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:26:44,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820047032] [2024-11-10 18:26:44,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:44,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:26:44,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:44,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:26:44,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:26:44,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:44,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-10 18:26:44,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:44,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:44,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:44,505 INFO L124 PetriNetUnfolderBase]: 109/258 cut-off events. [2024-11-10 18:26:44,506 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:44,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 258 events. 109/258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1040 event pairs, 94 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 474. Up to 204 conditions per place. [2024-11-10 18:26:44,509 INFO L140 encePairwiseOnDemand]: 31/33 looper letters, 15 selfloop transitions, 1 changer transitions 1/26 dead transitions. [2024-11-10 18:26:44,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 92 flow [2024-11-10 18:26:44,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:26:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:26:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-10 18:26:44,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-10 18:26:44,513 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 60 flow. Second operand 3 states and 48 transitions. [2024-11-10 18:26:44,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 92 flow [2024-11-10 18:26:44,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:26:44,516 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 58 flow [2024-11-10 18:26:44,517 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2024-11-10 18:26:44,519 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2024-11-10 18:26:44,519 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 58 flow [2024-11-10 18:26:44,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-10 18:26:44,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:44,521 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:44,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:26:44,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:44,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:44,523 INFO L85 PathProgramCache]: Analyzing trace with hash 397721363, now seen corresponding path program 1 times [2024-11-10 18:26:44,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:44,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327842236] [2024-11-10 18:26:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:44,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:26:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:44,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:26:44,615 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:26:44,619 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-10 18:26:44,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-10 18:26:44,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-10 18:26:44,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2024-11-10 18:26:44,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-10 18:26:44,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:26:44,626 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 18:26:44,631 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 18:26:44,632 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 18:26:44,668 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:26:44,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 52 transitions, 124 flow [2024-11-10 18:26:44,690 INFO L124 PetriNetUnfolderBase]: 15/83 cut-off events. [2024-11-10 18:26:44,692 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:26:44,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 83 events. 15/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 226 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 94. Up to 6 conditions per place. [2024-11-10 18:26:44,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 52 transitions, 124 flow [2024-11-10 18:26:44,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 36 transitions, 85 flow [2024-11-10 18:26:44,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:26:44,698 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;@2f644750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:26:44,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 18:26:44,704 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:26:44,705 INFO L124 PetriNetUnfolderBase]: 2/18 cut-off events. [2024-11-10 18:26:44,705 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:44,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:44,705 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:44,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 18:26:44,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:44,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2131371400, now seen corresponding path program 1 times [2024-11-10 18:26:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:44,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475110319] [2024-11-10 18:26:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:44,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475110319] [2024-11-10 18:26:44,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475110319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:44,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:44,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:26:44,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867690059] [2024-11-10 18:26:44,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:44,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:26:44,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:44,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:26:44,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:26:44,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 52 [2024-11-10 18:26:44,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 85 flow. Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:44,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:44,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 52 [2024-11-10 18:26:44,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:44,941 INFO L124 PetriNetUnfolderBase]: 729/1298 cut-off events. [2024-11-10 18:26:44,941 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-10 18:26:44,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 1298 events. 729/1298 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6564 event pairs, 666 based on Foata normal form. 198/1441 useless extension candidates. Maximal degree in co-relation 533. Up to 1129 conditions per place. [2024-11-10 18:26:44,953 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 21 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2024-11-10 18:26:44,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 117 flow [2024-11-10 18:26:44,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:26:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:26:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2024-11-10 18:26:44,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5480769230769231 [2024-11-10 18:26:44,955 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 85 flow. Second operand 2 states and 57 transitions. [2024-11-10 18:26:44,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 117 flow [2024-11-10 18:26:44,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:44,957 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 74 flow [2024-11-10 18:26:44,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2024-11-10 18:26:44,958 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2024-11-10 18:26:44,958 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 74 flow [2024-11-10 18:26:44,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:44,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:44,959 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:44,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:26:44,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 18:26:44,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:44,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1659930766, now seen corresponding path program 1 times [2024-11-10 18:26:44,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:44,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459507986] [2024-11-10 18:26:44,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:45,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459507986] [2024-11-10 18:26:45,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459507986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:45,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:45,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:26:45,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109466245] [2024-11-10 18:26:45,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:45,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:26:45,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:45,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:26:45,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:26:45,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 52 [2024-11-10 18:26:45,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:45,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:45,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 52 [2024-11-10 18:26:45,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:45,208 INFO L124 PetriNetUnfolderBase]: 729/1291 cut-off events. [2024-11-10 18:26:45,209 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 18:26:45,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2480 conditions, 1291 events. 729/1291 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6492 event pairs, 666 based on Foata normal form. 0/1236 useless extension candidates. Maximal degree in co-relation 2475. Up to 1128 conditions per place. [2024-11-10 18:26:45,218 INFO L140 encePairwiseOnDemand]: 50/52 looper letters, 19 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2024-11-10 18:26:45,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 114 flow [2024-11-10 18:26:45,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:26:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:26:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-10 18:26:45,220 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2024-11-10 18:26:45,220 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 74 flow. Second operand 3 states and 67 transitions. [2024-11-10 18:26:45,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 114 flow [2024-11-10 18:26:45,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:26:45,221 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 72 flow [2024-11-10 18:26:45,222 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2024-11-10 18:26:45,223 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2024-11-10 18:26:45,224 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 72 flow [2024-11-10 18:26:45,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:45,224 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:45,225 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:45,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:26:45,225 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 18:26:45,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:45,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1889327409, now seen corresponding path program 1 times [2024-11-10 18:26:45,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:45,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732278492] [2024-11-10 18:26:45,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:45,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:45,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:26:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:45,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:26:45,267 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:26:45,267 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-10 18:26:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-10 18:26:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-10 18:26:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2024-11-10 18:26:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-11-10 18:26:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-10 18:26:45,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:26:45,268 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 18:26:45,269 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 18:26:45,269 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 18:26:45,306 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:26:45,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 71 transitions, 178 flow [2024-11-10 18:26:45,323 INFO L124 PetriNetUnfolderBase]: 20/111 cut-off events. [2024-11-10 18:26:45,323 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 18:26:45,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 111 events. 20/111 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 334 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 128. Up to 8 conditions per place. [2024-11-10 18:26:45,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 71 transitions, 178 flow [2024-11-10 18:26:45,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 101 flow [2024-11-10 18:26:45,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:26:45,331 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;@2f644750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:26:45,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 18:26:45,335 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:26:45,337 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-10 18:26:45,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:45,338 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:45,338 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:45,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:45,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2037772682, now seen corresponding path program 1 times [2024-11-10 18:26:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:45,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241096085] [2024-11-10 18:26:45,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:45,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:45,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:45,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241096085] [2024-11-10 18:26:45,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241096085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:45,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:45,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:26:45,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706455517] [2024-11-10 18:26:45,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:45,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:26:45,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:45,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:26:45,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:26:45,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2024-11-10 18:26:45,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 101 flow. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:45,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:45,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2024-11-10 18:26:45,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:45,934 INFO L124 PetriNetUnfolderBase]: 4121/6156 cut-off events. [2024-11-10 18:26:45,935 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-11-10 18:26:45,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12146 conditions, 6156 events. 4121/6156 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 32936 event pairs, 3866 based on Foata normal form. 838/6827 useless extension candidates. Maximal degree in co-relation 2476. Up to 5737 conditions per place. [2024-11-10 18:26:45,986 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 25 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2024-11-10 18:26:45,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 141 flow [2024-11-10 18:26:45,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:26:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:26:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2024-11-10 18:26:45,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-10 18:26:45,990 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 101 flow. Second operand 2 states and 71 transitions. [2024-11-10 18:26:45,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 141 flow [2024-11-10 18:26:45,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 138 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:45,996 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 88 flow [2024-11-10 18:26:45,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2024-11-10 18:26:45,998 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2024-11-10 18:26:45,999 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 88 flow [2024-11-10 18:26:45,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:45,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:45,999 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:45,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:26:45,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:46,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:46,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1266001973, now seen corresponding path program 1 times [2024-11-10 18:26:46,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:46,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344081174] [2024-11-10 18:26:46,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:46,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:46,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:46,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344081174] [2024-11-10 18:26:46,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344081174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:46,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:46,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:26:46,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119205687] [2024-11-10 18:26:46,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:46,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:26:46,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:46,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:26:46,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:26:46,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-10 18:26:46,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:46,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:46,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-10 18:26:46,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:46,616 INFO L124 PetriNetUnfolderBase]: 4121/6133 cut-off events. [2024-11-10 18:26:46,616 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2024-11-10 18:26:46,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12107 conditions, 6133 events. 4121/6133 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 32615 event pairs, 3866 based on Foata normal form. 0/5966 useless extension candidates. Maximal degree in co-relation 12101. Up to 5736 conditions per place. [2024-11-10 18:26:46,660 INFO L140 encePairwiseOnDemand]: 69/71 looper letters, 23 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2024-11-10 18:26:46,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 136 flow [2024-11-10 18:26:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:26:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:26:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-10 18:26:46,663 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40375586854460094 [2024-11-10 18:26:46,664 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 88 flow. Second operand 3 states and 86 transitions. [2024-11-10 18:26:46,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 136 flow [2024-11-10 18:26:46,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:26:46,666 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 86 flow [2024-11-10 18:26:46,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-11-10 18:26:46,667 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-11-10 18:26:46,669 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 86 flow [2024-11-10 18:26:46,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:46,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:46,669 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:46,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:26:46,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:46,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash 506186488, now seen corresponding path program 1 times [2024-11-10 18:26:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:46,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303562462] [2024-11-10 18:26:46,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:46,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:46,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:26:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:46,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:26:46,710 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:26:46,710 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 18:26:46,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 18:26:46,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-10 18:26:46,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 18:26:46,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-10 18:26:46,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-10 18:26:46,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 18:26:46,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:26:46,711 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 18:26:46,751 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2024-11-10 18:26:46,752 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:26:46,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:26:46 BasicIcfg [2024-11-10 18:26:46,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:26:46,763 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:26:46,763 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:26:46,763 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:26:46,765 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:43" (3/4) ... [2024-11-10 18:26:46,768 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:26:46,770 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:26:46,770 INFO L158 Benchmark]: Toolchain (without parser) took 4417.43ms. Allocated memory was 184.5MB in the beginning and 260.0MB in the end (delta: 75.5MB). Free memory was 112.8MB in the beginning and 108.0MB in the end (delta: 4.8MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. [2024-11-10 18:26:46,771 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:46,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.26ms. Allocated memory is still 184.5MB. Free memory was 112.6MB in the beginning and 149.4MB in the end (delta: -36.8MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-11-10 18:26:46,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.64ms. Allocated memory is still 184.5MB. Free memory was 149.4MB in the beginning and 147.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:46,771 INFO L158 Benchmark]: Boogie Preprocessor took 51.46ms. Allocated memory is still 184.5MB. Free memory was 147.2MB in the beginning and 145.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:46,772 INFO L158 Benchmark]: IcfgBuilder took 580.39ms. Allocated memory is still 184.5MB. Free memory was 145.2MB in the beginning and 123.0MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:46,772 INFO L158 Benchmark]: TraceAbstraction took 3108.44ms. Allocated memory was 184.5MB in the beginning and 260.0MB in the end (delta: 75.5MB). Free memory was 122.1MB in the beginning and 109.1MB in the end (delta: 13.1MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2024-11-10 18:26:46,772 INFO L158 Benchmark]: Witness Printer took 7.19ms. Allocated memory is still 260.0MB. Free memory was 109.1MB in the beginning and 108.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:46,774 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.18ms. Allocated memory is still 184.5MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.26ms. Allocated memory is still 184.5MB. Free memory was 112.6MB in the beginning and 149.4MB in the end (delta: -36.8MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.64ms. Allocated memory is still 184.5MB. Free memory was 149.4MB in the beginning and 147.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.46ms. Allocated memory is still 184.5MB. Free memory was 147.2MB in the beginning and 145.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 580.39ms. Allocated memory is still 184.5MB. Free memory was 145.2MB in the beginning and 123.0MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3108.44ms. Allocated memory was 184.5MB in the beginning and 260.0MB in the end (delta: 75.5MB). Free memory was 122.1MB in the beginning and 109.1MB in the end (delta: 13.1MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. * Witness Printer took 7.19ms. Allocated memory is still 260.0MB. Free memory was 109.1MB in the beginning and 108.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L770] 0 _N = __VERIFIER_nondet_int() [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=0, limit=0] [L773] 0 int i = 0; VAL [_N=0, i=0, limit=0] [L773] COND FALSE 0 !(i < _N) VAL [_N=0, i=0, limit=0] [L777] 0 pthread_t t; [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [_N=0, limit=0, t=-1] [L763] 1 int i, bound; [L764] 1 bound = limit [L765] 1 i = 0 VAL [\old(arg)={0:0}, _N=0, arg={0:0}, bound=0, i=0, limit=0] [L765] COND FALSE 1 !(i < bound) VAL [\old(arg)={0:0}, _N=0, arg={0:0}, bound=0, i=0, limit=0] [L766] CALL 1 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 1 !expression [L753] CALL 1 reach_error() [L752] COND FALSE 1 !(0) VAL [_N=0, limit=0] [L752] 1 __assert_fail ("0", "generated/unwind3.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=0, limit=0] - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 1 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, InterpolantAutomatonStates: 5, 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.2s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 31 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 60 locations, 6 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: 0.6s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, InterpolantAutomatonStates: 5, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 31 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 9 procedures, 75 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 1 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=0, InterpolantAutomatonStates: 5, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 31 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 18:26:46,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind3-nondet.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 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:26:49,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:26:49,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:26:49,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:26:49,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:26:49,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:26:49,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:26:49,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:26:49,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:26:49,369 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:26:49,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:26:49,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:26:49,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:26:49,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:26:49,372 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:26:49,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:26:49,375 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:26:49,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:26:49,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:26:49,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:26:49,376 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:26:49,377 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:26:49,377 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:26:49,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:26:49,377 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:26:49,378 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:26:49,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:26:49,378 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:26:49,378 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:26:49,378 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:26:49,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:26:49,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:26:49,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:26:49,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:26:49,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:26:49,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:49,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:26:49,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:26:49,383 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:26:49,383 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:26:49,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:26:49,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:26:49,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:26:49,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:26:49,385 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 -> 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 [2024-11-10 18:26:49,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:26:49,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:26:49,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:26:49,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:26:49,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:26:49,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2024-11-10 18:26:51,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:26:51,716 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:26:51,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2024-11-10 18:26:51,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd636daaf/6a706084cbc548459afa939b4c216638/FLAG68310550f [2024-11-10 18:26:51,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd636daaf/6a706084cbc548459afa939b4c216638 [2024-11-10 18:26:51,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:26:51,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:26:51,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:51,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:26:51,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:26:51,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:51" (1/1) ... [2024-11-10 18:26:51,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76668894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:51, skipping insertion in model container [2024-11-10 18:26:51,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:51" (1/1) ... [2024-11-10 18:26:51,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:26:52,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:52,277 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:26:52,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:52,381 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:26:52,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52 WrapperNode [2024-11-10 18:26:52,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:52,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:52,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:26:52,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:26:52,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,447 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2024-11-10 18:26:52,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:52,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:26:52,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:26:52,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:26:52,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,488 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 18:26:52,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,499 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:26:52,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:26:52,514 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:26:52,514 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:26:52,515 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (1/1) ... [2024-11-10 18:26:52,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:52,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:52,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:26:52,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:26:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:26:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-10 18:26:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-10 18:26:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-10 18:26:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-10 18:26:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:26:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:26:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:26:52,593 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:26:52,780 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:26:52,783 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:26:53,011 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:26:53,011 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:26:53,178 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:26:53,179 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:26:53,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:53 BoogieIcfgContainer [2024-11-10 18:26:53,179 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:26:53,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:26:53,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:26:53,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:26:53,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:26:51" (1/3) ... [2024-11-10 18:26:53,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5f5047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:53, skipping insertion in model container [2024-11-10 18:26:53,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:52" (2/3) ... [2024-11-10 18:26:53,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5f5047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:53, skipping insertion in model container [2024-11-10 18:26:53,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:53" (3/3) ... [2024-11-10 18:26:53,191 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind3-nondet.i [2024-11-10 18:26:53,209 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:26:53,209 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 18:26:53,209 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:26:53,260 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:26:53,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 74 flow [2024-11-10 18:26:53,346 INFO L124 PetriNetUnfolderBase]: 10/55 cut-off events. [2024-11-10 18:26:53,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:53,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 55 events. 10/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 126 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2024-11-10 18:26:53,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 74 flow [2024-11-10 18:26:53,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 32 transitions, 71 flow [2024-11-10 18:26:53,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:26:53,376 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;@717e0014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:26:53,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 18:26:53,384 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:26:53,386 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-10 18:26:53,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:53,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:53,388 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:53,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:53,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1287863526, now seen corresponding path program 1 times [2024-11-10 18:26:53,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:53,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28603293] [2024-11-10 18:26:53,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:53,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:53,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:53,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:26:53,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 18:26:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:53,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 18:26:53,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:53,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:53,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:53,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28603293] [2024-11-10 18:26:53,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28603293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:53,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:53,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:26:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306897644] [2024-11-10 18:26:53,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:53,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:26:53,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:53,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:26:53,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:26:53,565 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-11-10 18:26:53,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 32 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:53,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:53,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-11-10 18:26:53,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:53,675 INFO L124 PetriNetUnfolderBase]: 109/261 cut-off events. [2024-11-10 18:26:53,675 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 18:26:53,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 261 events. 109/261 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1068 event pairs, 94 based on Foata normal form. 50/292 useless extension candidates. Maximal degree in co-relation 394. Up to 205 conditions per place. [2024-11-10 18:26:53,683 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 17 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2024-11-10 18:26:53,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 95 flow [2024-11-10 18:26:53,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:26:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:26:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2024-11-10 18:26:53,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-11-10 18:26:53,696 INFO L175 Difference]: Start difference. First operand has 33 places, 32 transitions, 71 flow. Second operand 2 states and 43 transitions. [2024-11-10 18:26:53,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 95 flow [2024-11-10 18:26:53,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:53,702 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 60 flow [2024-11-10 18:26:53,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-11-10 18:26:53,708 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2024-11-10 18:26:53,709 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 60 flow [2024-11-10 18:26:53,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:53,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:53,709 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:53,716 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-10 18:26:53,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:53,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:53,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1257655724, now seen corresponding path program 1 times [2024-11-10 18:26:53,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999931100] [2024-11-10 18:26:53,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:53,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:53,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:53,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:26:53,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 18:26:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:53,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:26:54,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:54,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:54,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:54,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999931100] [2024-11-10 18:26:54,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999931100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:54,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:54,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:26:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952578233] [2024-11-10 18:26:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:54,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:26:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:54,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:26:54,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:26:54,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-11-10 18:26:54,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-10 18:26:54,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:54,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-11-10 18:26:54,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:54,099 INFO L124 PetriNetUnfolderBase]: 109/258 cut-off events. [2024-11-10 18:26:54,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:54,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 258 events. 109/258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1040 event pairs, 94 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 474. Up to 204 conditions per place. [2024-11-10 18:26:54,102 INFO L140 encePairwiseOnDemand]: 31/33 looper letters, 15 selfloop transitions, 1 changer transitions 1/26 dead transitions. [2024-11-10 18:26:54,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 92 flow [2024-11-10 18:26:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:26:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:26:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-10 18:26:54,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-10 18:26:54,106 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 60 flow. Second operand 3 states and 48 transitions. [2024-11-10 18:26:54,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 92 flow [2024-11-10 18:26:54,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:26:54,109 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 58 flow [2024-11-10 18:26:54,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2024-11-10 18:26:54,111 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2024-11-10 18:26:54,112 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 58 flow [2024-11-10 18:26:54,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 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-10 18:26:54,112 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:54,112 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:54,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 18:26:54,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:54,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash 397721363, now seen corresponding path program 1 times [2024-11-10 18:26:54,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:54,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362714385] [2024-11-10 18:26:54,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:54,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:54,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:54,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:26:54,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 18:26:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:54,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:26:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:54,420 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 18:26:54,421 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:26:54,422 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-10 18:26:54,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-10 18:26:54,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-10 18:26:54,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2024-11-10 18:26:54,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-10 18:26:54,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 18:26:54,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:54,626 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 18:26:54,628 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 18:26:54,628 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 18:26:54,653 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:26:54,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 52 transitions, 124 flow [2024-11-10 18:26:54,674 INFO L124 PetriNetUnfolderBase]: 15/83 cut-off events. [2024-11-10 18:26:54,674 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:26:54,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 83 events. 15/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 226 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 94. Up to 6 conditions per place. [2024-11-10 18:26:54,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 52 transitions, 124 flow [2024-11-10 18:26:54,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 36 transitions, 85 flow [2024-11-10 18:26:54,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:26:54,678 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;@717e0014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:26:54,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 18:26:54,680 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:26:54,681 INFO L124 PetriNetUnfolderBase]: 2/18 cut-off events. [2024-11-10 18:26:54,681 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:54,681 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:54,681 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:54,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 18:26:54,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:54,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2131371400, now seen corresponding path program 1 times [2024-11-10 18:26:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:54,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119483655] [2024-11-10 18:26:54,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:54,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:54,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:54,686 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:26:54,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 18:26:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:54,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 18:26:54,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:54,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:54,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119483655] [2024-11-10 18:26:54,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119483655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:54,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:54,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:26:54,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296933398] [2024-11-10 18:26:54,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:54,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:26:54,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:54,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:26:54,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:26:54,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 52 [2024-11-10 18:26:54,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 85 flow. Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:54,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:54,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 52 [2024-11-10 18:26:54,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:54,966 INFO L124 PetriNetUnfolderBase]: 729/1298 cut-off events. [2024-11-10 18:26:54,967 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-10 18:26:54,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 1298 events. 729/1298 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6564 event pairs, 666 based on Foata normal form. 198/1441 useless extension candidates. Maximal degree in co-relation 533. Up to 1129 conditions per place. [2024-11-10 18:26:54,977 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 21 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2024-11-10 18:26:54,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 117 flow [2024-11-10 18:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:26:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:26:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2024-11-10 18:26:54,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5480769230769231 [2024-11-10 18:26:54,982 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 85 flow. Second operand 2 states and 57 transitions. [2024-11-10 18:26:54,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 117 flow [2024-11-10 18:26:54,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:54,984 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 74 flow [2024-11-10 18:26:54,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2024-11-10 18:26:54,985 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2024-11-10 18:26:54,985 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 74 flow [2024-11-10 18:26:54,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:54,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:54,986 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:54,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 18:26:55,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:55,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 18:26:55,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:55,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1659930766, now seen corresponding path program 1 times [2024-11-10 18:26:55,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:55,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349618510] [2024-11-10 18:26:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:55,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:55,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:55,192 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:26:55,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 18:26:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:55,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:26:55,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:55,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:55,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:55,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349618510] [2024-11-10 18:26:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349618510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:55,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:26:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079206101] [2024-11-10 18:26:55,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:55,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:26:55,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:55,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:26:55,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:26:55,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 52 [2024-11-10 18:26:55,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:55,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:55,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 52 [2024-11-10 18:26:55,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:55,437 INFO L124 PetriNetUnfolderBase]: 729/1291 cut-off events. [2024-11-10 18:26:55,438 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 18:26:55,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2480 conditions, 1291 events. 729/1291 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6492 event pairs, 666 based on Foata normal form. 0/1236 useless extension candidates. Maximal degree in co-relation 2475. Up to 1128 conditions per place. [2024-11-10 18:26:55,447 INFO L140 encePairwiseOnDemand]: 50/52 looper letters, 19 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2024-11-10 18:26:55,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 114 flow [2024-11-10 18:26:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:26:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:26:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-10 18:26:55,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2024-11-10 18:26:55,451 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 74 flow. Second operand 3 states and 67 transitions. [2024-11-10 18:26:55,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 114 flow [2024-11-10 18:26:55,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:26:55,453 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 72 flow [2024-11-10 18:26:55,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2024-11-10 18:26:55,454 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2024-11-10 18:26:55,462 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 72 flow [2024-11-10 18:26:55,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:55,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:55,463 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:55,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 18:26:55,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:55,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 18:26:55,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1889327409, now seen corresponding path program 1 times [2024-11-10 18:26:55,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:55,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555196528] [2024-11-10 18:26:55,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:55,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:55,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:55,670 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:26:55,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 18:26:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:55,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:26:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:55,778 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 18:26:55,778 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:26:55,779 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-10 18:26:55,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-10 18:26:55,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-10 18:26:55,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2024-11-10 18:26:55,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-11-10 18:26:55,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-10 18:26:55,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 18:26:55,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:55,984 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 18:26:55,984 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 18:26:55,984 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 18:26:56,022 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:26:56,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 71 transitions, 178 flow [2024-11-10 18:26:56,032 INFO L124 PetriNetUnfolderBase]: 20/111 cut-off events. [2024-11-10 18:26:56,032 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 18:26:56,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 111 events. 20/111 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 334 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 128. Up to 8 conditions per place. [2024-11-10 18:26:56,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 71 transitions, 178 flow [2024-11-10 18:26:56,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 40 transitions, 101 flow [2024-11-10 18:26:56,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:26:56,035 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;@717e0014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:26:56,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 18:26:56,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:26:56,038 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-10 18:26:56,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:26:56,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:56,038 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:56,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:56,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:56,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2037772682, now seen corresponding path program 1 times [2024-11-10 18:26:56,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:56,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34139551] [2024-11-10 18:26:56,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:56,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:56,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:56,042 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:26:56,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 18:26:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:56,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 18:26:56,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:56,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:56,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34139551] [2024-11-10 18:26:56,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34139551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:56,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:56,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:26:56,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366244756] [2024-11-10 18:26:56,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:56,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:26:56,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:56,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:26:56,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:26:56,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 71 [2024-11-10 18:26:56,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 101 flow. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:56,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:56,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 71 [2024-11-10 18:26:56,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:56,663 INFO L124 PetriNetUnfolderBase]: 4121/6156 cut-off events. [2024-11-10 18:26:56,663 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-11-10 18:26:56,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12146 conditions, 6156 events. 4121/6156 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 32936 event pairs, 3866 based on Foata normal form. 838/6827 useless extension candidates. Maximal degree in co-relation 2476. Up to 5737 conditions per place. [2024-11-10 18:26:56,706 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 25 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2024-11-10 18:26:56,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 141 flow [2024-11-10 18:26:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:26:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:26:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2024-11-10 18:26:56,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-10 18:26:56,708 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 101 flow. Second operand 2 states and 71 transitions. [2024-11-10 18:26:56,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 141 flow [2024-11-10 18:26:56,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 138 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:56,713 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 88 flow [2024-11-10 18:26:56,713 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2024-11-10 18:26:56,714 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2024-11-10 18:26:56,714 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 88 flow [2024-11-10 18:26:56,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:56,714 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:56,714 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:56,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 18:26:56,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:56,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:56,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:56,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1266001973, now seen corresponding path program 1 times [2024-11-10 18:26:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:56,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084674819] [2024-11-10 18:26:56,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:56,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:56,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:56,919 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:26:56,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 18:26:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:56,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:26:56,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:57,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:57,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:57,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084674819] [2024-11-10 18:26:57,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084674819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:57,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:57,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:26:57,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279045105] [2024-11-10 18:26:57,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:57,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:26:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:57,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:26:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:26:57,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 71 [2024-11-10 18:26:57,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:57,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:57,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 71 [2024-11-10 18:26:57,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:57,638 INFO L124 PetriNetUnfolderBase]: 4121/6133 cut-off events. [2024-11-10 18:26:57,639 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2024-11-10 18:26:57,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12107 conditions, 6133 events. 4121/6133 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 32615 event pairs, 3866 based on Foata normal form. 0/5966 useless extension candidates. Maximal degree in co-relation 12101. Up to 5736 conditions per place. [2024-11-10 18:26:57,677 INFO L140 encePairwiseOnDemand]: 69/71 looper letters, 23 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2024-11-10 18:26:57,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 136 flow [2024-11-10 18:26:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:26:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:26:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-10 18:26:57,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40375586854460094 [2024-11-10 18:26:57,679 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 88 flow. Second operand 3 states and 86 transitions. [2024-11-10 18:26:57,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 136 flow [2024-11-10 18:26:57,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:26:57,681 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 86 flow [2024-11-10 18:26:57,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-11-10 18:26:57,682 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-11-10 18:26:57,682 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 86 flow [2024-11-10 18:26:57,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:57,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:57,682 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:57,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 18:26:57,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:57,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 18:26:57,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash 506186488, now seen corresponding path program 1 times [2024-11-10 18:26:57,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:57,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789592991] [2024-11-10 18:26:57,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:57,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:57,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:57,886 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:26:57,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 18:26:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:57,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:26:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:57,982 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 18:26:57,982 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:26:57,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 18:26:57,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 18:26:57,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-10 18:26:57,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 18:26:57,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-10 18:26:57,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-10 18:26:57,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 18:26:57,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 18:26:58,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:26:58,184 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 18:26:58,212 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2024-11-10 18:26:58,212 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:26:58,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:26:58 BasicIcfg [2024-11-10 18:26:58,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:26:58,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:26:58,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:26:58,218 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:26:58,218 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:53" (3/4) ... [2024-11-10 18:26:58,220 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:26:58,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:26:58,222 INFO L158 Benchmark]: Toolchain (without parser) took 6464.01ms. Allocated memory was 77.6MB in the beginning and 201.3MB in the end (delta: 123.7MB). Free memory was 47.7MB in the beginning and 74.4MB in the end (delta: -26.8MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. [2024-11-10 18:26:58,222 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 48.2MB. Free memory is still 26.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:58,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.39ms. Allocated memory is still 77.6MB. Free memory was 47.4MB in the beginning and 46.8MB in the end (delta: 620.9kB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-10 18:26:58,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.51ms. Allocated memory is still 77.6MB. Free memory was 46.8MB in the beginning and 44.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:58,223 INFO L158 Benchmark]: Boogie Preprocessor took 64.11ms. Allocated memory is still 77.6MB. Free memory was 44.6MB in the beginning and 42.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:58,223 INFO L158 Benchmark]: IcfgBuilder took 666.07ms. Allocated memory was 77.6MB in the beginning and 107.0MB in the end (delta: 29.4MB). Free memory was 42.6MB in the beginning and 71.6MB in the end (delta: -29.0MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-11-10 18:26:58,223 INFO L158 Benchmark]: TraceAbstraction took 5034.86ms. Allocated memory was 107.0MB in the beginning and 201.3MB in the end (delta: 94.4MB). Free memory was 71.1MB in the beginning and 74.4MB in the end (delta: -3.4MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2024-11-10 18:26:58,224 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 201.3MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:58,225 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.07ms. Allocated memory is still 48.2MB. Free memory is still 26.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.39ms. Allocated memory is still 77.6MB. Free memory was 47.4MB in the beginning and 46.8MB in the end (delta: 620.9kB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.51ms. Allocated memory is still 77.6MB. Free memory was 46.8MB in the beginning and 44.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.11ms. Allocated memory is still 77.6MB. Free memory was 44.6MB in the beginning and 42.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 666.07ms. Allocated memory was 77.6MB in the beginning and 107.0MB in the end (delta: 29.4MB). Free memory was 42.6MB in the beginning and 71.6MB in the end (delta: -29.0MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5034.86ms. Allocated memory was 107.0MB in the beginning and 201.3MB in the end (delta: 94.4MB). Free memory was 71.1MB in the beginning and 74.4MB in the end (delta: -3.4MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 201.3MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L770] 0 _N = __VERIFIER_nondet_int() [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=0, limit=0] [L773] 0 int i = 0; VAL [_N=0, i=0, limit=0] [L773] COND FALSE 0 !(i < _N) VAL [_N=0, i=0, limit=0] [L777] 0 pthread_t t; [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [_N=0, limit=0, t=0] [L763] 1 int i, bound; [L764] 1 bound = limit [L765] 1 i = 0 VAL [\old(arg)={0:0}, _N=0, arg={0:0}, bound=0, i=0, limit=0] [L765] COND FALSE 1 !(i < bound) VAL [\old(arg)={0:0}, _N=0, arg={0:0}, bound=0, i=0, limit=0] [L766] CALL 1 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 1 !expression [L753] CALL 1 reach_error() [L752] COND FALSE 1 !(0) VAL [_N=0, limit=0] [L752] 1 __assert_fail ("0", "generated/unwind3.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=0, limit=0] - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, InterpolantAutomatonStates: 5, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 31 SizeOfPredicates, 0 NumberOfNonLiveVariables, 55 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 60 locations, 6 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: 1.3s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 1 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, InterpolantAutomatonStates: 5, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 31 SizeOfPredicates, 0 NumberOfNonLiveVariables, 55 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 9 procedures, 75 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 1 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=0, InterpolantAutomatonStates: 5, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 31 SizeOfPredicates, 0 NumberOfNonLiveVariables, 55 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 18:26:58,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample