./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:59:47,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:59:47,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:59:47,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:59:47,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:59:48,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:59:48,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:59:48,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:59:48,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:59:48,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:59:48,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:59:48,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:59:48,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:59:48,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:59:48,017 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:59:48,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:59:48,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:59:48,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:59:48,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:59:48,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:59:48,019 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:59:48,020 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:59:48,020 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:59:48,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:59:48,031 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:59:48,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:59:48,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:59:48,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:59:48,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:59:48,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:59:48,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:59:48,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:59:48,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:59:48,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:59:48,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:59:48,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:59:48,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:59:48,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:59:48,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:59:48,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:59:48,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:59:48,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:59:48,037 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2024-11-09 10:59:48,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:59:48,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:59:48,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:59:48,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:59:48,324 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:59:48,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-09 10:59:49,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:59:50,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:59:50,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-09 10:59:50,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6dd2d913/106fe05f707b40c8a55add8be5bb726b/FLAGcad703cf2 [2024-11-09 10:59:50,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6dd2d913/106fe05f707b40c8a55add8be5bb726b [2024-11-09 10:59:50,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:59:50,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:59:50,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:59:50,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:59:50,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:59:50,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:50,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46617e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50, skipping insertion in model container [2024-11-09 10:59:50,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:50,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:59:50,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:59:50,829 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:59:50,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:59:50,922 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:59:50,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50 WrapperNode [2024-11-09 10:59:50,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:59:50,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:59:50,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:59:50,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:59:50,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:50,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:50,980 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 85 [2024-11-09 10:59:50,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:59:50,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:59:50,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:59:50,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:59:50,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:50,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:50,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:51,015 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 10:59:51,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:51,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:51,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:51,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:51,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:51,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:51,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:59:51,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:59:51,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:59:51,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:59:51,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (1/1) ... [2024-11-09 10:59:51,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:59:51,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:51,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:59:51,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:59:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:59:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-09 10:59:51,128 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-09 10:59:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-09 10:59:51,128 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-09 10:59:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:59:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:59:51,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:59:51,130 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:59:51,255 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:59:51,258 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:59:51,395 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:59:51,395 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:59:51,500 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:59:51,500 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:59:51,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:51 BoogieIcfgContainer [2024-11-09 10:59:51,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:59:51,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:59:51,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:59:51,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:59:51,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:59:50" (1/3) ... [2024-11-09 10:59:51,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ede02b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:59:51, skipping insertion in model container [2024-11-09 10:59:51,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:59:50" (2/3) ... [2024-11-09 10:59:51,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ede02b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:59:51, skipping insertion in model container [2024-11-09 10:59:51,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:51" (3/3) ... [2024-11-09 10:59:51,510 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2024-11-09 10:59:51,527 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:59:51,528 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:59:51,528 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:59:51,588 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:59:51,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2024-11-09 10:59:51,666 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2024-11-09 10:59:51,669 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:59:51,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-09 10:59:51,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2024-11-09 10:59:51,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 82 flow [2024-11-09 10:59:51,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:59:51,703 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;@45941820, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:59:51,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:59:51,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:59:51,720 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-09 10:59:51,720 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:59:51,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:51,721 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:51,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:59:51,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash 338354967, now seen corresponding path program 1 times [2024-11-09 10:59:51,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969767294] [2024-11-09 10:59:51,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:51,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:52,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969767294] [2024-11-09 10:59:52,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969767294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:52,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:52,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:59:52,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984649673] [2024-11-09 10:59:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:52,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:59:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:52,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:59:52,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:59:52,220 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 10:59:52,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:52,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:52,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 10:59:52,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:52,548 INFO L124 PetriNetUnfolderBase]: 287/602 cut-off events. [2024-11-09 10:59:52,549 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-09 10:59:52,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 602 events. 287/602 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3097 event pairs, 42 based on Foata normal form. 112/658 useless extension candidates. Maximal degree in co-relation 1048. Up to 215 conditions per place. [2024-11-09 10:59:52,560 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 58 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-11-09 10:59:52,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 74 transitions, 307 flow [2024-11-09 10:59:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:59:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:59:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-11-09 10:59:52,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-09 10:59:52,577 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 82 flow. Second operand 7 states and 152 transitions. [2024-11-09 10:59:52,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 74 transitions, 307 flow [2024-11-09 10:59:52,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 74 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:59:52,584 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 111 flow [2024-11-09 10:59:52,586 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2024-11-09 10:59:52,591 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2024-11-09 10:59:52,591 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 111 flow [2024-11-09 10:59:52,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:52,592 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:52,592 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:52,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:59:52,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:59:52,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1898083594, now seen corresponding path program 1 times [2024-11-09 10:59:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:52,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131809849] [2024-11-09 10:59:52,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:52,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:52,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:52,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131809849] [2024-11-09 10:59:52,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131809849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:52,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425708113] [2024-11-09 10:59:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:52,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:52,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:52,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:59:52,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 10:59:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:52,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:59:52,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:52,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:53,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425708113] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:53,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:59:53,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-09 10:59:53,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359276103] [2024-11-09 10:59:53,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:53,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:59:53,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:53,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:59:53,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:59:53,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-11-09 10:59:53,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:53,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:53,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-11-09 10:59:53,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:53,453 INFO L124 PetriNetUnfolderBase]: 513/1033 cut-off events. [2024-11-09 10:59:53,454 INFO L125 PetriNetUnfolderBase]: For 156/166 co-relation queries the response was YES. [2024-11-09 10:59:53,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287 conditions, 1033 events. 513/1033 cut-off events. For 156/166 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5859 event pairs, 81 based on Foata normal form. 10/884 useless extension candidates. Maximal degree in co-relation 853. Up to 332 conditions per place. [2024-11-09 10:59:53,469 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 73 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-11-09 10:59:53,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 98 transitions, 438 flow [2024-11-09 10:59:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:59:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:59:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-11-09 10:59:53,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5380116959064327 [2024-11-09 10:59:53,475 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 111 flow. Second operand 9 states and 184 transitions. [2024-11-09 10:59:53,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 98 transitions, 438 flow [2024-11-09 10:59:53,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 98 transitions, 427 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-09 10:59:53,481 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 170 flow [2024-11-09 10:59:53,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=170, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-11-09 10:59:53,482 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2024-11-09 10:59:53,482 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 170 flow [2024-11-09 10:59:53,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:53,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:53,483 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:53,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:59:53,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:53,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:59:53,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:53,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1289936521, now seen corresponding path program 2 times [2024-11-09 10:59:53,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:53,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313660843] [2024-11-09 10:59:53,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:53,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:53,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313660843] [2024-11-09 10:59:53,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313660843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:53,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835413998] [2024-11-09 10:59:53,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:59:53,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:53,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:53,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:59:53,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 10:59:53,889 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:59:53,890 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:59:53,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:59:53,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:53,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:59:53,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835413998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:53,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 10:59:53,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-09 10:59:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327018366] [2024-11-09 10:59:53,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:53,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:59:53,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:53,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:59:53,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:59:53,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 10:59:53,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:53,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:53,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 10:59:53,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:54,318 INFO L124 PetriNetUnfolderBase]: 403/865 cut-off events. [2024-11-09 10:59:54,319 INFO L125 PetriNetUnfolderBase]: For 558/568 co-relation queries the response was YES. [2024-11-09 10:59:54,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 865 events. 403/865 cut-off events. For 558/568 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4926 event pairs, 101 based on Foata normal form. 26/838 useless extension candidates. Maximal degree in co-relation 1319. Up to 362 conditions per place. [2024-11-09 10:59:54,325 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 77 selfloop transitions, 12 changer transitions 0/99 dead transitions. [2024-11-09 10:59:54,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 99 transitions, 505 flow [2024-11-09 10:59:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:59:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:59:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-11-09 10:59:54,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2024-11-09 10:59:54,328 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 170 flow. Second operand 10 states and 185 transitions. [2024-11-09 10:59:54,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 99 transitions, 505 flow [2024-11-09 10:59:54,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 485 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-09 10:59:54,336 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 214 flow [2024-11-09 10:59:54,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=214, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-11-09 10:59:54,337 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2024-11-09 10:59:54,337 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 214 flow [2024-11-09 10:59:54,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:54,338 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:54,338 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:54,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:59:54,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-09 10:59:54,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:59:54,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 84955400, now seen corresponding path program 1 times [2024-11-09 10:59:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335289693] [2024-11-09 10:59:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:54,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:54,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335289693] [2024-11-09 10:59:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335289693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:54,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:59:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608660010] [2024-11-09 10:59:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:54,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:59:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:54,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:59:54,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:59:54,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 10:59:54,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:54,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:54,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 10:59:54,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:54,831 INFO L124 PetriNetUnfolderBase]: 473/1010 cut-off events. [2024-11-09 10:59:54,832 INFO L125 PetriNetUnfolderBase]: For 986/1004 co-relation queries the response was YES. [2024-11-09 10:59:54,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2606 conditions, 1010 events. 473/1010 cut-off events. For 986/1004 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5894 event pairs, 154 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 1783. Up to 489 conditions per place. [2024-11-09 10:59:54,840 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 64 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2024-11-09 10:59:54,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 575 flow [2024-11-09 10:59:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:59:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:59:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-11-09 10:59:54,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2024-11-09 10:59:54,842 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 214 flow. Second operand 7 states and 132 transitions. [2024-11-09 10:59:54,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 575 flow [2024-11-09 10:59:54,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 558 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-09 10:59:54,848 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 262 flow [2024-11-09 10:59:54,849 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2024-11-09 10:59:54,849 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2024-11-09 10:59:54,850 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 262 flow [2024-11-09 10:59:54,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:54,851 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:54,851 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:54,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:59:54,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:59:54,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1662335674, now seen corresponding path program 1 times [2024-11-09 10:59:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:54,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617709721] [2024-11-09 10:59:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:54,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:54,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617709721] [2024-11-09 10:59:54,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617709721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:54,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700180013] [2024-11-09 10:59:54,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:54,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:54,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:54,954 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:59:54,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 10:59:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:55,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:59:55,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:55,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:55,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700180013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:55,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:59:55,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-09 10:59:55,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197388145] [2024-11-09 10:59:55,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:55,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:59:55,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:55,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:59:55,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:59:55,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 10:59:55,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 262 flow. Second operand has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 11 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:55,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:55,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 10:59:55,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:55,451 INFO L124 PetriNetUnfolderBase]: 543/1153 cut-off events. [2024-11-09 10:59:55,451 INFO L125 PetriNetUnfolderBase]: For 1395/1419 co-relation queries the response was YES. [2024-11-09 10:59:55,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3493 conditions, 1153 events. 543/1153 cut-off events. For 1395/1419 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6878 event pairs, 136 based on Foata normal form. 0/1092 useless extension candidates. Maximal degree in co-relation 2372. Up to 489 conditions per place. [2024-11-09 10:59:55,461 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 84 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2024-11-09 10:59:55,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 109 transitions, 798 flow [2024-11-09 10:59:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:59:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:59:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-11-09 10:59:55,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49415204678362573 [2024-11-09 10:59:55,462 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 262 flow. Second operand 9 states and 169 transitions. [2024-11-09 10:59:55,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 109 transitions, 798 flow [2024-11-09 10:59:55,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 109 transitions, 782 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-09 10:59:55,472 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 312 flow [2024-11-09 10:59:55,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=312, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2024-11-09 10:59:55,472 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2024-11-09 10:59:55,473 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 312 flow [2024-11-09 10:59:55,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 11 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:55,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:55,473 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:55,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:59:55,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:55,678 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:59:55,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1032604834, now seen corresponding path program 1 times [2024-11-09 10:59:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:55,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288181266] [2024-11-09 10:59:55,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:55,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:55,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:55,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288181266] [2024-11-09 10:59:55,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288181266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:55,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:55,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:59:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867442908] [2024-11-09 10:59:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:55,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:59:55,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:55,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:59:55,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:59:55,749 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 10:59:55,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:55,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:55,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 10:59:55,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:55,965 INFO L124 PetriNetUnfolderBase]: 473/997 cut-off events. [2024-11-09 10:59:55,965 INFO L125 PetriNetUnfolderBase]: For 1685/1707 co-relation queries the response was YES. [2024-11-09 10:59:55,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3390 conditions, 997 events. 473/997 cut-off events. For 1685/1707 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5551 event pairs, 150 based on Foata normal form. 14/963 useless extension candidates. Maximal degree in co-relation 2138. Up to 522 conditions per place. [2024-11-09 10:59:55,972 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 54 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2024-11-09 10:59:55,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 576 flow [2024-11-09 10:59:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:59:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:59:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-11-09 10:59:55,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2024-11-09 10:59:55,974 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 312 flow. Second operand 6 states and 111 transitions. [2024-11-09 10:59:55,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 576 flow [2024-11-09 10:59:55,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 527 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-09 10:59:55,982 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 293 flow [2024-11-09 10:59:55,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2024-11-09 10:59:55,983 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 32 predicate places. [2024-11-09 10:59:55,983 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 293 flow [2024-11-09 10:59:55,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:55,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:55,983 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:55,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:59:55,984 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:59:55,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1116409153, now seen corresponding path program 1 times [2024-11-09 10:59:55,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:55,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910425017] [2024-11-09 10:59:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:56,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910425017] [2024-11-09 10:59:56,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910425017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:59:56,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:59:56,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:59:56,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935256796] [2024-11-09 10:59:56,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:59:56,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:59:56,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:56,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:59:56,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:59:56,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 10:59:56,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:56,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:56,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 10:59:56,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:56,231 INFO L124 PetriNetUnfolderBase]: 487/1034 cut-off events. [2024-11-09 10:59:56,231 INFO L125 PetriNetUnfolderBase]: For 1802/1834 co-relation queries the response was YES. [2024-11-09 10:59:56,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 1034 events. 487/1034 cut-off events. For 1802/1834 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5818 event pairs, 161 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 2151. Up to 546 conditions per place. [2024-11-09 10:59:56,239 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 59 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2024-11-09 10:59:56,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 582 flow [2024-11-09 10:59:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:59:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:59:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-11-09 10:59:56,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5043859649122807 [2024-11-09 10:59:56,241 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 293 flow. Second operand 6 states and 115 transitions. [2024-11-09 10:59:56,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 582 flow [2024-11-09 10:59:56,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 80 transitions, 553 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-09 10:59:56,248 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 310 flow [2024-11-09 10:59:56,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2024-11-09 10:59:56,248 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-11-09 10:59:56,249 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 310 flow [2024-11-09 10:59:56,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:56,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:56,249 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:56,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:59:56,249 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:59:56,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:56,250 INFO L85 PathProgramCache]: Analyzing trace with hash 6215880, now seen corresponding path program 2 times [2024-11-09 10:59:56,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:56,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368608455] [2024-11-09 10:59:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:56,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:59:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:56,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:59:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368608455] [2024-11-09 10:59:56,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368608455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:59:56,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425167193] [2024-11-09 10:59:56,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:59:56,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:56,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:59:56,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:59:56,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 10:59:56,432 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:59:56,432 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:59:56,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:59:56,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:59:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:56,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:59:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:59:56,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425167193] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:59:56,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:59:56,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-09 10:59:56,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414482746] [2024-11-09 10:59:56,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:59:56,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 10:59:56,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:59:56,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 10:59:56,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:59:56,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-11-09 10:59:56,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 310 flow. Second operand has 20 states, 20 states have (on average 10.35) internal successors, (207), 20 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:56,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:59:56,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-11-09 10:59:56,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:59:57,450 INFO L124 PetriNetUnfolderBase]: 513/995 cut-off events. [2024-11-09 10:59:57,450 INFO L125 PetriNetUnfolderBase]: For 2152/2186 co-relation queries the response was YES. [2024-11-09 10:59:57,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3427 conditions, 995 events. 513/995 cut-off events. For 2152/2186 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5229 event pairs, 63 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 2830. Up to 188 conditions per place. [2024-11-09 10:59:57,460 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 124 selfloop transitions, 23 changer transitions 0/155 dead transitions. [2024-11-09 10:59:57,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 155 transitions, 1204 flow [2024-11-09 10:59:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:59:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 10:59:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 247 transitions. [2024-11-09 10:59:57,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-11-09 10:59:57,463 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 310 flow. Second operand 14 states and 247 transitions. [2024-11-09 10:59:57,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 155 transitions, 1204 flow [2024-11-09 10:59:57,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 155 transitions, 1155 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-09 10:59:57,474 INFO L231 Difference]: Finished difference. Result has 84 places, 58 transitions, 407 flow [2024-11-09 10:59:57,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=407, PETRI_PLACES=84, PETRI_TRANSITIONS=58} [2024-11-09 10:59:57,475 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 48 predicate places. [2024-11-09 10:59:57,475 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 58 transitions, 407 flow [2024-11-09 10:59:57,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.35) internal successors, (207), 20 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:59:57,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:59:57,476 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:59:57,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 10:59:57,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:59:57,676 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:59:57,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:59:57,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1678074481, now seen corresponding path program 1 times [2024-11-09 10:59:57,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:59:57,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036247113] [2024-11-09 10:59:57,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:59:57,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:59:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:57,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:59:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:59:57,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:59:57,717 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:59:57,719 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 10:59:57,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:59:57,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-09 10:59:57,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:59:57,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-09 10:59:57,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:59:57,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:59:57,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:59:57,724 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-11-09 10:59:57,760 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:59:57,760 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:59:57,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:59:57 BasicIcfg [2024-11-09 10:59:57,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:59:57,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:59:57,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:59:57,767 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:59:57,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:59:51" (3/4) ... [2024-11-09 10:59:57,769 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:59:57,770 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:59:57,771 INFO L158 Benchmark]: Toolchain (without parser) took 7427.17ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 114.2MB in the beginning and 211.8MB in the end (delta: -97.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:59:57,771 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:59:57,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.88ms. Allocated memory is still 159.4MB. Free memory was 113.6MB in the beginning and 91.1MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 10:59:57,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.04ms. Allocated memory is still 159.4MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:59:57,772 INFO L158 Benchmark]: Boogie Preprocessor took 55.98ms. Allocated memory is still 159.4MB. Free memory was 89.0MB in the beginning and 86.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:59:57,772 INFO L158 Benchmark]: RCFGBuilder took 460.89ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 65.3MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 10:59:57,773 INFO L158 Benchmark]: TraceAbstraction took 6262.80ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 64.7MB in the beginning and 211.8MB in the end (delta: -147.1MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2024-11-09 10:59:57,773 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 249.6MB. Free memory is still 211.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:59:57,775 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.20ms. Allocated memory is still 159.4MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 578.88ms. Allocated memory is still 159.4MB. Free memory was 113.6MB in the beginning and 91.1MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.04ms. Allocated memory is still 159.4MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.98ms. Allocated memory is still 159.4MB. Free memory was 89.0MB in the beginning and 86.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 460.89ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 65.3MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6262.80ms. Allocated memory was 159.4MB in the beginning and 249.6MB in the end (delta: 90.2MB). Free memory was 64.7MB in the beginning and 211.8MB in the end (delta: -147.1MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 249.6MB. Free memory is still 211.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=-2] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=-2, t2=-1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [_N=1, limit=1] [L752] 2 __assert_fail ("0", "generated/unwind2.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=1, limit=1] - UnprovableResult [Line: 774]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1024 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1010 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 137 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1702 IncrementalHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 38 mSDtfsCounter, 1702 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=8, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 560 SizeOfPredicates, 18 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 5/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:59:57,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:00:00,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:00:00,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 11:00:00,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:00:00,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:00:00,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:00:00,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:00:00,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:00:00,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:00:00,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:00:00,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:00:00,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:00:00,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:00:00,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:00:00,143 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:00:00,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:00:00,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:00:00,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:00:00,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:00:00,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:00:00,145 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 11:00:00,147 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 11:00:00,147 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 11:00:00,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:00:00,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 11:00:00,148 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 11:00:00,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:00:00,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 11:00:00,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:00:00,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:00:00,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:00:00,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:00:00,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:00:00,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:00:00,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:00:00,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:00:00,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:00:00,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:00:00,157 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 11:00:00,157 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 11:00:00,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:00:00,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:00:00,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:00:00,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:00:00,162 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2024-11-09 11:00:00,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:00:00,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:00:00,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:00:00,515 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:00:00,515 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:00:00,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-09 11:00:02,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:00:02,393 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:00:02,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-09 11:00:02,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/446c45e5d/ba35439a781f4e93891e6963dad1294b/FLAGdcac8f76a [2024-11-09 11:00:02,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/446c45e5d/ba35439a781f4e93891e6963dad1294b [2024-11-09 11:00:02,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:00:02,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:00:02,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:00:02,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:00:02,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:00:02,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:00:02" (1/1) ... [2024-11-09 11:00:02,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fbfb032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:02, skipping insertion in model container [2024-11-09 11:00:02,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:00:02" (1/1) ... [2024-11-09 11:00:02,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:00:02,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:00:02,924 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:00:02,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:00:03,019 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:00:03,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03 WrapperNode [2024-11-09 11:00:03,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:00:03,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:00:03,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:00:03,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:00:03,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,074 INFO L138 Inliner]: procedures = 170, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 86 [2024-11-09 11:00:03,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:00:03,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:00:03,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:00:03,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:00:03,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,120 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:00:03,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:00:03,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:00:03,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:00:03,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:00:03,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (1/1) ... [2024-11-09 11:00:03,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:00:03,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:00:03,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:00:03,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:00:03,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:00:03,230 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-09 11:00:03,231 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-09 11:00:03,231 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-09 11:00:03,231 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-09 11:00:03,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 11:00:03,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:00:03,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:00:03,232 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 11:00:03,397 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:00:03,401 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:00:03,607 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 11:00:03,608 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:00:03,761 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:00:03,762 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:00:03,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:00:03 BoogieIcfgContainer [2024-11-09 11:00:03,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:00:03,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:00:03,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:00:03,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:00:03,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:00:02" (1/3) ... [2024-11-09 11:00:03,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb466ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:00:03, skipping insertion in model container [2024-11-09 11:00:03,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:00:03" (2/3) ... [2024-11-09 11:00:03,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb466ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:00:03, skipping insertion in model container [2024-11-09 11:00:03,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:00:03" (3/3) ... [2024-11-09 11:00:03,770 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2024-11-09 11:00:03,786 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:00:03,786 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 11:00:03,786 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 11:00:03,855 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 11:00:03,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2024-11-09 11:00:03,926 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2024-11-09 11:00:03,926 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 11:00:03,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-09 11:00:03,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2024-11-09 11:00:03,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 82 flow [2024-11-09 11:00:03,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:00:03,948 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;@74bddfe1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:00:03,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 11:00:03,956 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 11:00:03,956 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-09 11:00:03,956 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 11:00:03,956 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:03,957 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:03,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 11:00:03,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:03,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2043240985, now seen corresponding path program 1 times [2024-11-09 11:00:03,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:03,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969423659] [2024-11-09 11:00:03,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:03,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:03,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:03,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 11:00:03,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 11:00:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:04,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:00:04,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:04,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:00:04,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:04,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969423659] [2024-11-09 11:00:04,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969423659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:00:04,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:00:04,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:00:04,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889330021] [2024-11-09 11:00:04,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:00:04,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:00:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:04,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:00:04,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:00:04,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 11:00:04,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:04,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:04,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 11:00:04,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:04,697 INFO L124 PetriNetUnfolderBase]: 287/602 cut-off events. [2024-11-09 11:00:04,697 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-09 11:00:04,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 602 events. 287/602 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3114 event pairs, 42 based on Foata normal form. 112/658 useless extension candidates. Maximal degree in co-relation 1048. Up to 215 conditions per place. [2024-11-09 11:00:04,725 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 58 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-11-09 11:00:04,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 74 transitions, 307 flow [2024-11-09 11:00:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:00:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 11:00:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-11-09 11:00:04,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-09 11:00:04,740 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 82 flow. Second operand 7 states and 152 transitions. [2024-11-09 11:00:04,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 74 transitions, 307 flow [2024-11-09 11:00:04,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 74 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 11:00:04,746 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 111 flow [2024-11-09 11:00:04,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2024-11-09 11:00:04,753 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2024-11-09 11:00:04,753 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 111 flow [2024-11-09 11:00:04,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:04,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:04,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:04,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:00:04,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:04,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 11:00:04,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1085024694, now seen corresponding path program 1 times [2024-11-09 11:00:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:04,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131452464] [2024-11-09 11:00:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:04,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:04,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:04,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 11:00:04,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 11:00:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:05,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:00:05,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:05,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:00:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:05,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:05,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131452464] [2024-11-09 11:00:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131452464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:00:05,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:00:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-09 11:00:05,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200834475] [2024-11-09 11:00:05,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:00:05,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:00:05,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:05,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:00:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:00:05,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-11-09 11:00:05,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:05,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:05,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-11-09 11:00:05,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:05,700 INFO L124 PetriNetUnfolderBase]: 513/1019 cut-off events. [2024-11-09 11:00:05,700 INFO L125 PetriNetUnfolderBase]: For 115/117 co-relation queries the response was YES. [2024-11-09 11:00:05,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2281 conditions, 1019 events. 513/1019 cut-off events. For 115/117 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5773 event pairs, 45 based on Foata normal form. 2/864 useless extension candidates. Maximal degree in co-relation 850. Up to 332 conditions per place. [2024-11-09 11:00:05,709 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 73 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-11-09 11:00:05,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 98 transitions, 438 flow [2024-11-09 11:00:05,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:00:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 11:00:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-11-09 11:00:05,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5380116959064327 [2024-11-09 11:00:05,712 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 111 flow. Second operand 9 states and 184 transitions. [2024-11-09 11:00:05,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 98 transitions, 438 flow [2024-11-09 11:00:05,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 98 transitions, 427 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-09 11:00:05,723 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 170 flow [2024-11-09 11:00:05,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=170, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-11-09 11:00:05,724 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2024-11-09 11:00:05,725 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 170 flow [2024-11-09 11:00:05,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:05,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:05,726 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:05,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 11:00:05,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:05,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 11:00:05,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:05,928 INFO L85 PathProgramCache]: Analyzing trace with hash 722987065, now seen corresponding path program 2 times [2024-11-09 11:00:05,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:05,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002851835] [2024-11-09 11:00:05,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:00:05,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:05,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:05,931 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 11:00:05,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 11:00:05,996 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:00:05,996 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:00:05,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:00:06,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:06,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:00:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:06,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:06,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002851835] [2024-11-09 11:00:06,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002851835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:00:06,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:00:06,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-09 11:00:06,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700269044] [2024-11-09 11:00:06,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:00:06,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:00:06,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:06,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:00:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:00:06,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 11:00:06,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 170 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:06,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:06,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 11:00:06,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:06,757 INFO L124 PetriNetUnfolderBase]: 403/859 cut-off events. [2024-11-09 11:00:06,757 INFO L125 PetriNetUnfolderBase]: For 545/555 co-relation queries the response was YES. [2024-11-09 11:00:06,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2209 conditions, 859 events. 403/859 cut-off events. For 545/555 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4866 event pairs, 25 based on Foata normal form. 26/834 useless extension candidates. Maximal degree in co-relation 1315. Up to 233 conditions per place. [2024-11-09 11:00:06,763 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 84 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2024-11-09 11:00:06,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 109 transitions, 546 flow [2024-11-09 11:00:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 11:00:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 11:00:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 216 transitions. [2024-11-09 11:00:06,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-11-09 11:00:06,766 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 170 flow. Second operand 12 states and 216 transitions. [2024-11-09 11:00:06,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 109 transitions, 546 flow [2024-11-09 11:00:06,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 109 transitions, 526 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-09 11:00:06,773 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 228 flow [2024-11-09 11:00:06,774 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=228, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-09 11:00:06,775 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2024-11-09 11:00:06,775 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 228 flow [2024-11-09 11:00:06,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:06,775 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:06,775 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:06,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 11:00:06,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:06,976 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 11:00:06,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2097878986, now seen corresponding path program 1 times [2024-11-09 11:00:06,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18438511] [2024-11-09 11:00:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:06,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 11:00:06,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 11:00:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:07,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:00:07,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:07,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:00:07,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18438511] [2024-11-09 11:00:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18438511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:00:07,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:00:07,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:00:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54349851] [2024-11-09 11:00:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:00:07,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:00:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:00:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:00:07,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 11:00:07,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:07,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:07,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 11:00:07,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:07,314 INFO L124 PetriNetUnfolderBase]: 473/1018 cut-off events. [2024-11-09 11:00:07,314 INFO L125 PetriNetUnfolderBase]: For 1134/1152 co-relation queries the response was YES. [2024-11-09 11:00:07,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2716 conditions, 1018 events. 473/1018 cut-off events. For 1134/1152 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6020 event pairs, 136 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1851. Up to 489 conditions per place. [2024-11-09 11:00:07,322 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 66 selfloop transitions, 12 changer transitions 0/88 dead transitions. [2024-11-09 11:00:07,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 613 flow [2024-11-09 11:00:07,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:00:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 11:00:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-11-09 11:00:07,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2024-11-09 11:00:07,324 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 228 flow. Second operand 7 states and 132 transitions. [2024-11-09 11:00:07,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 613 flow [2024-11-09 11:00:07,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 582 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-09 11:00:07,331 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 267 flow [2024-11-09 11:00:07,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2024-11-09 11:00:07,332 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2024-11-09 11:00:07,332 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 267 flow [2024-11-09 11:00:07,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:07,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:07,333 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:07,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 11:00:07,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:07,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 11:00:07,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash 608753350, now seen corresponding path program 1 times [2024-11-09 11:00:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:07,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401741930] [2024-11-09 11:00:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:07,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:07,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:07,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 11:00:07,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 11:00:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:07,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:00:07,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:07,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:00:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:07,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401741930] [2024-11-09 11:00:07,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401741930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:00:07,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:00:07,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-09 11:00:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937701984] [2024-11-09 11:00:07,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:00:07,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:00:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:07,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:00:07,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:00:07,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 11:00:07,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 267 flow. Second operand has 12 states, 12 states have (on average 11.583333333333334) internal successors, (139), 12 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:07,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:07,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 11:00:07,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:08,161 INFO L124 PetriNetUnfolderBase]: 543/1151 cut-off events. [2024-11-09 11:00:08,161 INFO L125 PetriNetUnfolderBase]: For 1508/1532 co-relation queries the response was YES. [2024-11-09 11:00:08,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3567 conditions, 1151 events. 543/1151 cut-off events. For 1508/1532 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6885 event pairs, 154 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 2406. Up to 489 conditions per place. [2024-11-09 11:00:08,169 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 87 selfloop transitions, 15 changer transitions 0/112 dead transitions. [2024-11-09 11:00:08,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 112 transitions, 837 flow [2024-11-09 11:00:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:00:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 11:00:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-11-09 11:00:08,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49415204678362573 [2024-11-09 11:00:08,172 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 267 flow. Second operand 9 states and 169 transitions. [2024-11-09 11:00:08,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 112 transitions, 837 flow [2024-11-09 11:00:08,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 112 transitions, 821 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-09 11:00:08,180 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 316 flow [2024-11-09 11:00:08,180 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=316, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2024-11-09 11:00:08,181 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-11-09 11:00:08,182 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 316 flow [2024-11-09 11:00:08,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.583333333333334) internal successors, (139), 12 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:08,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:08,183 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:08,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 11:00:08,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:08,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 11:00:08,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash 139544498, now seen corresponding path program 1 times [2024-11-09 11:00:08,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:08,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949902241] [2024-11-09 11:00:08,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:08,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:08,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:08,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 11:00:08,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 11:00:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:08,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:00:08,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:08,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:00:08,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:08,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949902241] [2024-11-09 11:00:08,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949902241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:00:08,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:00:08,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:00:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621636988] [2024-11-09 11:00:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:00:08,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:00:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:08,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:00:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:00:08,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 11:00:08,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:08,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:08,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 11:00:08,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:08,709 INFO L124 PetriNetUnfolderBase]: 473/997 cut-off events. [2024-11-09 11:00:08,709 INFO L125 PetriNetUnfolderBase]: For 1781/1803 co-relation queries the response was YES. [2024-11-09 11:00:08,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3438 conditions, 997 events. 473/997 cut-off events. For 1781/1803 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5565 event pairs, 150 based on Foata normal form. 14/963 useless extension candidates. Maximal degree in co-relation 2144. Up to 522 conditions per place. [2024-11-09 11:00:08,717 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 55 selfloop transitions, 12 changer transitions 0/76 dead transitions. [2024-11-09 11:00:08,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 583 flow [2024-11-09 11:00:08,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:00:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 11:00:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-11-09 11:00:08,718 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2024-11-09 11:00:08,718 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 316 flow. Second operand 6 states and 111 transitions. [2024-11-09 11:00:08,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 583 flow [2024-11-09 11:00:08,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 534 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-09 11:00:08,726 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 297 flow [2024-11-09 11:00:08,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2024-11-09 11:00:08,727 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2024-11-09 11:00:08,727 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 297 flow [2024-11-09 11:00:08,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:08,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:08,728 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:08,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 11:00:08,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:08,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 11:00:08,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash 106162721, now seen corresponding path program 1 times [2024-11-09 11:00:08,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:08,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867465194] [2024-11-09 11:00:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:08,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:08,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:08,934 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 11:00:08,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 11:00:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:00:08,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:00:08,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:09,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-09 11:00:09,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:00:09,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:09,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867465194] [2024-11-09 11:00:09,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867465194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:00:09,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:00:09,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:00:09,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332729725] [2024-11-09 11:00:09,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:00:09,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:00:09,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:09,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:00:09,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:00:09,035 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-09 11:00:09,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:09,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:09,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-09 11:00:09,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:09,244 INFO L124 PetriNetUnfolderBase]: 487/1036 cut-off events. [2024-11-09 11:00:09,245 INFO L125 PetriNetUnfolderBase]: For 1854/1884 co-relation queries the response was YES. [2024-11-09 11:00:09,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 1036 events. 487/1036 cut-off events. For 1854/1884 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5875 event pairs, 152 based on Foata normal form. 0/990 useless extension candidates. Maximal degree in co-relation 2161. Up to 546 conditions per place. [2024-11-09 11:00:09,252 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 60 selfloop transitions, 12 changer transitions 0/81 dead transitions. [2024-11-09 11:00:09,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 81 transitions, 590 flow [2024-11-09 11:00:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:00:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 11:00:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-11-09 11:00:09,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5043859649122807 [2024-11-09 11:00:09,254 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 297 flow. Second operand 6 states and 115 transitions. [2024-11-09 11:00:09,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 81 transitions, 590 flow [2024-11-09 11:00:09,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 81 transitions, 551 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-09 11:00:09,261 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 306 flow [2024-11-09 11:00:09,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2024-11-09 11:00:09,264 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-11-09 11:00:09,264 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 306 flow [2024-11-09 11:00:09,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:09,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:09,265 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:09,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 11:00:09,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:09,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 11:00:09,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1690498890, now seen corresponding path program 2 times [2024-11-09 11:00:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:09,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854825745] [2024-11-09 11:00:09,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:00:09,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:09,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:09,471 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 11:00:09,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 11:00:09,513 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:00:09,513 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:00:09,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 11:00:09,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:00:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:09,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:00:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:00:09,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 11:00:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854825745] [2024-11-09 11:00:09,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854825745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:00:09,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:00:09,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-09 11:00:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75510786] [2024-11-09 11:00:09,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:00:09,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:00:09,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 11:00:09,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:00:09,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:00:09,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-11-09 11:00:09,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 306 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:09,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 11:00:09,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-11-09 11:00:09,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 11:00:10,182 INFO L124 PetriNetUnfolderBase]: 809/1592 cut-off events. [2024-11-09 11:00:10,182 INFO L125 PetriNetUnfolderBase]: For 3218/3302 co-relation queries the response was YES. [2024-11-09 11:00:10,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5498 conditions, 1592 events. 809/1592 cut-off events. For 3218/3302 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9646 event pairs, 114 based on Foata normal form. 16/1457 useless extension candidates. Maximal degree in co-relation 4315. Up to 517 conditions per place. [2024-11-09 11:00:10,193 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 122 selfloop transitions, 17 changer transitions 0/156 dead transitions. [2024-11-09 11:00:10,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 156 transitions, 1232 flow [2024-11-09 11:00:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:00:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 11:00:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-11-09 11:00:10,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5157894736842106 [2024-11-09 11:00:10,195 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 306 flow. Second operand 10 states and 196 transitions. [2024-11-09 11:00:10,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 156 transitions, 1232 flow [2024-11-09 11:00:10,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 156 transitions, 1186 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-09 11:00:10,208 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 366 flow [2024-11-09 11:00:10,209 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=366, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-11-09 11:00:10,209 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 41 predicate places. [2024-11-09 11:00:10,211 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 366 flow [2024-11-09 11:00:10,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:00:10,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 11:00:10,211 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:00:10,215 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-09 11:00:10,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:10,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 11:00:10,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:00:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash 921125357, now seen corresponding path program 1 times [2024-11-09 11:00:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 11:00:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666074843] [2024-11-09 11:00:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:00:10,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 11:00:10,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 11:00:10,417 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 11:00:10,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 11:00:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:00:10,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 11:00:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:00:10,539 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 11:00:10,540 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 11:00:10,543 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 11:00:10,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 11:00:10,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-09 11:00:10,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 11:00:10,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-09 11:00:10,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 11:00:10,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 11:00:10,552 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 (10)] Forceful destruction successful, exit code 0 [2024-11-09 11:00:10,747 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-09 11:00:10,747 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-11-09 11:00:10,777 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 11:00:10,777 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:00:10,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:00:10 BasicIcfg [2024-11-09 11:00:10,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:00:10,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:00:10,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:00:10,785 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:00:10,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:00:03" (3/4) ... [2024-11-09 11:00:10,787 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 11:00:10,788 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:00:10,789 INFO L158 Benchmark]: Toolchain (without parser) took 8354.98ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 38.0MB in the beginning and 96.2MB in the end (delta: -58.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:00:10,789 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 56.6MB. Free memory is still 31.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:00:10,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.16ms. Allocated memory is still 69.2MB. Free memory was 37.8MB in the beginning and 37.6MB in the end (delta: 195.6kB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-11-09 11:00:10,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.77ms. Allocated memory is still 69.2MB. Free memory was 37.6MB in the beginning and 35.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:00:10,790 INFO L158 Benchmark]: Boogie Preprocessor took 80.67ms. Allocated memory is still 69.2MB. Free memory was 35.3MB in the beginning and 33.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:00:10,790 INFO L158 Benchmark]: RCFGBuilder took 603.59ms. Allocated memory is still 69.2MB. Free memory was 33.0MB in the beginning and 26.8MB in the end (delta: 6.2MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-09 11:00:10,791 INFO L158 Benchmark]: TraceAbstraction took 7017.72ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 26.2MB in the beginning and 22.0MB in the end (delta: 4.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2024-11-09 11:00:10,791 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 121.6MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:00:10,793 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.82ms. Allocated memory is still 56.6MB. Free memory is still 31.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.16ms. Allocated memory is still 69.2MB. Free memory was 37.8MB in the beginning and 37.6MB in the end (delta: 195.6kB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.77ms. Allocated memory is still 69.2MB. Free memory was 37.6MB in the beginning and 35.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.67ms. Allocated memory is still 69.2MB. Free memory was 35.3MB in the beginning and 33.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 603.59ms. Allocated memory is still 69.2MB. Free memory was 33.0MB in the beginning and 26.8MB in the end (delta: 6.2MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7017.72ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 26.2MB in the beginning and 22.0MB in the end (delta: 4.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 121.6MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=0] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=0, t2=1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [_N=1, limit=1] [L752] 2 __assert_fail ("0", "generated/unwind2.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=1, limit=1] - UnprovableResult [Line: 774]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.9s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 904 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 894 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1981 IncrementalHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 25 mSDtfsCounter, 1981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=8, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 388 SizeOfPredicates, 26 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 4/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 11:00:10,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample