./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/rfi004.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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-wmm/rfi004.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 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:29:08,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:29:08,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:29:08,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:29:08,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:29:08,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:29:08,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:29:08,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:29:08,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:29:08,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:29:08,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:29:08,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:29:08,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:29:08,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:29:08,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:29:08,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:29:08,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:29:08,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:29:08,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:29:08,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:29:08,959 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:29:08,960 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:29:08,960 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:29:08,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:29:08,961 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:29:08,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:29:08,961 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:29:08,961 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:29:08,962 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:29:08,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:29:08,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:29:08,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:29:08,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:29:08,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:29:08,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:29:08,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:29:08,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:29:08,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:29:08,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:29:08,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:29:08,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:29:08,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:29:08,965 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 -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 [2024-11-22 21:29:09,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:29:09,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:29:09,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:29:09,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:29:09,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:29:09,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi004.i [2024-11-22 21:29:10,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:29:10,979 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:29:10,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi004.i [2024-11-22 21:29:10,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5d6e469/ebb7c74cdf2746fcb79345586f9eedf8/FLAG78415949f [2024-11-22 21:29:11,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5d6e469/ebb7c74cdf2746fcb79345586f9eedf8 [2024-11-22 21:29:11,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:29:11,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:29:11,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:29:11,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:29:11,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:29:11,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b916f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11, skipping insertion in model container [2024-11-22 21:29:11,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:29:11,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:29:11,468 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:29:11,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:29:11,582 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:29:11,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11 WrapperNode [2024-11-22 21:29:11,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:29:11,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:29:11,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:29:11,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:29:11,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,653 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 116 [2024-11-22 21:29:11,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:29:11,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:29:11,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:29:11,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:29:11,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,691 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-22 21:29:11,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:29:11,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:29:11,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:29:11,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:29:11,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (1/1) ... [2024-11-22 21:29:11,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:29:11,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:29:11,740 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-22 21:29:11,742 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-22 21:29:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:29:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:29:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:29:11,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:29:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:29:11,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:29:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:29:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:29:11,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:29:11,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:29:11,785 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:29:11,905 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:29:11,908 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:29:12,309 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:29:12,309 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:29:12,459 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:29:12,460 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:29:12,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:29:12 BoogieIcfgContainer [2024-11-22 21:29:12,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:29:12,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:29:12,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:29:12,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:29:12,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:29:11" (1/3) ... [2024-11-22 21:29:12,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17de23e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:29:12, skipping insertion in model container [2024-11-22 21:29:12,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:11" (2/3) ... [2024-11-22 21:29:12,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17de23e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:29:12, skipping insertion in model container [2024-11-22 21:29:12,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:29:12" (3/3) ... [2024-11-22 21:29:12,468 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2024-11-22 21:29:12,484 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:29:12,485 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:29:12,485 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:29:12,535 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:29:12,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 84 flow [2024-11-22 21:29:12,607 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2024-11-22 21:29:12,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:29:12,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 2/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2024-11-22 21:29:12,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 84 flow [2024-11-22 21:29:12,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 36 transitions, 78 flow [2024-11-22 21:29:12,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:29:12,636 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;@497992b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:29:12,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-22 21:29:12,643 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:29:12,644 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-22 21:29:12,644 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:29:12,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:12,645 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:29:12,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:12,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:12,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1722553387, now seen corresponding path program 1 times [2024-11-22 21:29:12,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:29:12,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700618168] [2024-11-22 21:29:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:29:12,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:29:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:29:13,176 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-22 21:29:13,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:29:13,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700618168] [2024-11-22 21:29:13,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700618168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:13,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:13,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:29:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334221555] [2024-11-22 21:29:13,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:13,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:29:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:29:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:29:13,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:29:13,227 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 38 [2024-11-22 21:29:13,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-22 21:29:13,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:13,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 38 [2024-11-22 21:29:13,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:13,451 INFO L124 PetriNetUnfolderBase]: 129/354 cut-off events. [2024-11-22 21:29:13,451 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:29:13,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 354 events. 129/354 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2050 event pairs, 18 based on Foata normal form. 24/370 useless extension candidates. Maximal degree in co-relation 588. Up to 184 conditions per place. [2024-11-22 21:29:13,458 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 21 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-11-22 21:29:13,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 138 flow [2024-11-22 21:29:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:29:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:29:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-22 21:29:13,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2024-11-22 21:29:13,472 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 78 flow. Second operand 3 states and 84 transitions. [2024-11-22 21:29:13,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 138 flow [2024-11-22 21:29:13,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:29:13,477 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2024-11-22 21:29:13,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-11-22 21:29:13,483 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2024-11-22 21:29:13,483 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2024-11-22 21:29:13,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-22 21:29:13,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:13,485 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:13,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:29:13,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:13,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1462658336, now seen corresponding path program 1 times [2024-11-22 21:29:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:29:13,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646242108] [2024-11-22 21:29:13,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:29:13,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:29:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:29:13,562 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-22 21:29:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:29:13,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646242108] [2024-11-22 21:29:13,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646242108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:13,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:13,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:29:13,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521452602] [2024-11-22 21:29:13,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:13,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:29:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:29:13,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:29:13,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:29:13,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-22 21:29:13,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:29:13,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:13,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-22 21:29:13,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:13,676 INFO L124 PetriNetUnfolderBase]: 112/283 cut-off events. [2024-11-22 21:29:13,676 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-22 21:29:13,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 283 events. 112/283 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1575 event pairs, 112 based on Foata normal form. 12/278 useless extension candidates. Maximal degree in co-relation 509. Up to 203 conditions per place. [2024-11-22 21:29:13,680 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 13 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2024-11-22 21:29:13,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 98 flow [2024-11-22 21:29:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:29:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:29:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-22 21:29:13,683 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5877192982456141 [2024-11-22 21:29:13,683 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 3 states and 67 transitions. [2024-11-22 21:29:13,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 98 flow [2024-11-22 21:29:13,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:29:13,685 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2024-11-22 21:29:13,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-11-22 21:29:13,686 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2024-11-22 21:29:13,686 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 64 flow [2024-11-22 21:29:13,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:29:13,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:13,687 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:13,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:29:13,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:13,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1462658319, now seen corresponding path program 1 times [2024-11-22 21:29:13,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:29:13,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706137392] [2024-11-22 21:29:13,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:29:13,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:29:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:29:13,985 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-22 21:29:13,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:29:13,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706137392] [2024-11-22 21:29:13,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706137392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:13,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:13,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:29:13,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063049292] [2024-11-22 21:29:13,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:13,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:29:13,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:29:13,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:29:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:29:14,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-11-22 21:29:14,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-22 21:29:14,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:14,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-11-22 21:29:14,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:14,289 INFO L124 PetriNetUnfolderBase]: 183/408 cut-off events. [2024-11-22 21:29:14,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:29:14,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 408 events. 183/408 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2364 event pairs, 45 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 745. Up to 151 conditions per place. [2024-11-22 21:29:14,293 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 19 selfloop transitions, 2 changer transitions 26/59 dead transitions. [2024-11-22 21:29:14,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 218 flow [2024-11-22 21:29:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:29:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:29:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-11-22 21:29:14,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.555921052631579 [2024-11-22 21:29:14,297 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 64 flow. Second operand 8 states and 169 transitions. [2024-11-22 21:29:14,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 218 flow [2024-11-22 21:29:14,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:29:14,301 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 77 flow [2024-11-22 21:29:14,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=77, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2024-11-22 21:29:14,303 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2024-11-22 21:29:14,304 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 77 flow [2024-11-22 21:29:14,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-22 21:29:14,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:14,304 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:14,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:29:14,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:14,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:14,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1777665042, now seen corresponding path program 1 times [2024-11-22 21:29:14,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:29:14,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405726676] [2024-11-22 21:29:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:29:14,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:29:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:29:14,507 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-22 21:29:14,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:29:14,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405726676] [2024-11-22 21:29:14,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405726676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:14,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:14,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:29:14,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950900156] [2024-11-22 21:29:14,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:14,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:29:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:29:14,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:29:14,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:29:14,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-11-22 21:29:14,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-22 21:29:14,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:14,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-11-22 21:29:14,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:14,643 INFO L124 PetriNetUnfolderBase]: 155/338 cut-off events. [2024-11-22 21:29:14,643 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-22 21:29:14,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 338 events. 155/338 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1598 event pairs, 24 based on Foata normal form. 20/347 useless extension candidates. Maximal degree in co-relation 700. Up to 156 conditions per place. [2024-11-22 21:29:14,647 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 28 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2024-11-22 21:29:14,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 177 flow [2024-11-22 21:29:14,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:29:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:29:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-11-22 21:29:14,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-22 21:29:14,650 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 77 flow. Second operand 4 states and 95 transitions. [2024-11-22 21:29:14,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 177 flow [2024-11-22 21:29:14,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 165 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-22 21:29:14,655 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 91 flow [2024-11-22 21:29:14,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-11-22 21:29:14,656 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2024-11-22 21:29:14,656 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 91 flow [2024-11-22 21:29:14,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 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-22 21:29:14,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:14,657 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:14,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:29:14,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:14,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash -955541264, now seen corresponding path program 1 times [2024-11-22 21:29:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:29:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749508051] [2024-11-22 21:29:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:29:14,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:29:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:29:14,913 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-22 21:29:14,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:29:14,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749508051] [2024-11-22 21:29:14,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749508051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:14,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:14,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:29:14,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068836547] [2024-11-22 21:29:14,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:14,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:29:14,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:29:14,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:29:14,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:29:14,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-11-22 21:29:14,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-22 21:29:14,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:14,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-11-22 21:29:14,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:15,020 INFO L124 PetriNetUnfolderBase]: 84/191 cut-off events. [2024-11-22 21:29:15,021 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-22 21:29:15,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 191 events. 84/191 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 661 event pairs, 16 based on Foata normal form. 14/196 useless extension candidates. Maximal degree in co-relation 444. Up to 71 conditions per place. [2024-11-22 21:29:15,022 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 24 selfloop transitions, 6 changer transitions 1/42 dead transitions. [2024-11-22 21:29:15,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 182 flow [2024-11-22 21:29:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:29:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:29:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-11-22 21:29:15,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5684210526315789 [2024-11-22 21:29:15,024 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 91 flow. Second operand 5 states and 108 transitions. [2024-11-22 21:29:15,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 182 flow [2024-11-22 21:29:15,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 169 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-22 21:29:15,026 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 103 flow [2024-11-22 21:29:15,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2024-11-22 21:29:15,027 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2024-11-22 21:29:15,027 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 103 flow [2024-11-22 21:29:15,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-22 21:29:15,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:15,029 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:15,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:29:15,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:15,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:15,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1360626481, now seen corresponding path program 1 times [2024-11-22 21:29:15,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:29:15,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459113525] [2024-11-22 21:29:15,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:29:15,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:29:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:29:15,327 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-22 21:29:15,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:29:15,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459113525] [2024-11-22 21:29:15,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459113525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:15,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:15,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:29:15,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155248919] [2024-11-22 21:29:15,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:15,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:29:15,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:29:15,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:29:15,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:29:15,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-22 21:29:15,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-22 21:29:15,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:15,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-22 21:29:15,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:15,536 INFO L124 PetriNetUnfolderBase]: 116/289 cut-off events. [2024-11-22 21:29:15,536 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-11-22 21:29:15,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 289 events. 116/289 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1132 event pairs, 29 based on Foata normal form. 4/282 useless extension candidates. Maximal degree in co-relation 632. Up to 127 conditions per place. [2024-11-22 21:29:15,538 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 25 selfloop transitions, 7 changer transitions 13/57 dead transitions. [2024-11-22 21:29:15,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 257 flow [2024-11-22 21:29:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:29:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:29:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-11-22 21:29:15,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5150375939849624 [2024-11-22 21:29:15,541 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 103 flow. Second operand 7 states and 137 transitions. [2024-11-22 21:29:15,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 257 flow [2024-11-22 21:29:15,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 223 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-22 21:29:15,546 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 115 flow [2024-11-22 21:29:15,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2024-11-22 21:29:15,547 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2024-11-22 21:29:15,547 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 115 flow [2024-11-22 21:29:15,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-22 21:29:15,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:15,547 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:15,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:29:15,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:15,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1106050077, now seen corresponding path program 2 times [2024-11-22 21:29:15,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:29:15,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26516046] [2024-11-22 21:29:15,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:29:15,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:29:15,579 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:29:15,579 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:29:15,856 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-22 21:29:15,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:29:15,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26516046] [2024-11-22 21:29:15,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26516046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:15,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:15,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:29:15,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9665535] [2024-11-22 21:29:15,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:15,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:29:15,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:29:15,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:29:15,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:29:15,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-22 21:29:15,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 115 flow. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:29:15,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:15,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-22 21:29:15,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:16,084 INFO L124 PetriNetUnfolderBase]: 135/349 cut-off events. [2024-11-22 21:29:16,084 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-11-22 21:29:16,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 349 events. 135/349 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1520 event pairs, 43 based on Foata normal form. 4/340 useless extension candidates. Maximal degree in co-relation 745. Up to 117 conditions per place. [2024-11-22 21:29:16,086 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 19 selfloop transitions, 3 changer transitions 24/58 dead transitions. [2024-11-22 21:29:16,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 267 flow [2024-11-22 21:29:16,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:29:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:29:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-11-22 21:29:16,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4967105263157895 [2024-11-22 21:29:16,088 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 115 flow. Second operand 8 states and 151 transitions. [2024-11-22 21:29:16,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 267 flow [2024-11-22 21:29:16,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 261 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-22 21:29:16,090 INFO L231 Difference]: Finished difference. Result has 53 places, 30 transitions, 100 flow [2024-11-22 21:29:16,091 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=53, PETRI_TRANSITIONS=30} [2024-11-22 21:29:16,091 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2024-11-22 21:29:16,092 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 30 transitions, 100 flow [2024-11-22 21:29:16,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:29:16,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:16,092 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:16,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:29:16,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:16,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:16,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1662670425, now seen corresponding path program 3 times [2024-11-22 21:29:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:29:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669329343] [2024-11-22 21:29:16,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:29:16,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:29:16,119 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:29:16,120 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:29:16,672 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-22 21:29:16,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:29:16,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669329343] [2024-11-22 21:29:16,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669329343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:16,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:16,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:29:16,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522402833] [2024-11-22 21:29:16,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:16,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:29:16,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:29:16,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:29:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:29:16,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 38 [2024-11-22 21:29:16,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 30 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-22 21:29:16,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:16,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 38 [2024-11-22 21:29:16,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:16,874 INFO L124 PetriNetUnfolderBase]: 67/189 cut-off events. [2024-11-22 21:29:16,874 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-22 21:29:16,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 189 events. 67/189 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 640 event pairs, 35 based on Foata normal form. 4/181 useless extension candidates. Maximal degree in co-relation 397. Up to 77 conditions per place. [2024-11-22 21:29:16,875 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 14 selfloop transitions, 2 changer transitions 17/48 dead transitions. [2024-11-22 21:29:16,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 210 flow [2024-11-22 21:29:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:29:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:29:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-11-22 21:29:16,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5328947368421053 [2024-11-22 21:29:16,877 INFO L175 Difference]: Start difference. First operand has 53 places, 30 transitions, 100 flow. Second operand 8 states and 162 transitions. [2024-11-22 21:29:16,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 210 flow [2024-11-22 21:29:16,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 185 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-11-22 21:29:16,879 INFO L231 Difference]: Finished difference. Result has 53 places, 30 transitions, 99 flow [2024-11-22 21:29:16,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=99, PETRI_PLACES=53, PETRI_TRANSITIONS=30} [2024-11-22 21:29:16,880 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2024-11-22 21:29:16,880 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 30 transitions, 99 flow [2024-11-22 21:29:16,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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-22 21:29:16,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:16,881 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:16,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:29:16,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:16,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1867037765, now seen corresponding path program 4 times [2024-11-22 21:29:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:29:16,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800744892] [2024-11-22 21:29:16,882 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:29:16,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:29:16,953 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:29:16,953 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:29:16,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:29:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:29:17,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:29:17,049 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:29:17,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-22 21:29:17,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-22 21:29:17,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-22 21:29:17,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-22 21:29:17,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-22 21:29:17,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-22 21:29:17,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:29:17,054 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-22 21:29:17,129 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:29:17,129 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:29:17,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:29:17 BasicIcfg [2024-11-22 21:29:17,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:29:17,138 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:29:17,138 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:29:17,138 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:29:17,138 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:29:12" (3/4) ... [2024-11-22 21:29:17,140 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:29:17,141 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:29:17,142 INFO L158 Benchmark]: Toolchain (without parser) took 6125.29ms. Allocated memory was 169.9MB in the beginning and 285.2MB in the end (delta: 115.3MB). Free memory was 136.6MB in the beginning and 218.4MB in the end (delta: -81.8MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-22 21:29:17,142 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:29:17,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.18ms. Allocated memory is still 169.9MB. Free memory was 136.6MB in the beginning and 111.6MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-22 21:29:17,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.61ms. Allocated memory is still 169.9MB. Free memory was 111.6MB in the beginning and 108.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:29:17,144 INFO L158 Benchmark]: Boogie Preprocessor took 49.36ms. Allocated memory is still 169.9MB. Free memory was 108.4MB in the beginning and 105.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:29:17,144 INFO L158 Benchmark]: RCFGBuilder took 752.57ms. Allocated memory is still 169.9MB. Free memory was 105.3MB in the beginning and 109.5MB in the end (delta: -4.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 21:29:17,144 INFO L158 Benchmark]: TraceAbstraction took 4675.06ms. Allocated memory was 169.9MB in the beginning and 285.2MB in the end (delta: 115.3MB). Free memory was 109.5MB in the beginning and 219.4MB in the end (delta: -109.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-11-22 21:29:17,144 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 285.2MB. Free memory was 219.4MB in the beginning and 218.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:29:17,146 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.18ms. Allocated memory is still 169.9MB. Free memory was 136.6MB in the beginning and 111.6MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.61ms. Allocated memory is still 169.9MB. Free memory was 111.6MB in the beginning and 108.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.36ms. Allocated memory is still 169.9MB. Free memory was 108.4MB in the beginning and 105.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 752.57ms. Allocated memory is still 169.9MB. Free memory was 105.3MB in the beginning and 109.5MB in the end (delta: -4.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4675.06ms. Allocated memory was 169.9MB in the beginning and 285.2MB in the end (delta: 115.3MB). Free memory was 109.5MB in the beginning and 219.4MB in the end (delta: -109.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 285.2MB. Free memory was 219.4MB in the beginning and 218.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1649; [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1649=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1650; [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L787] 2 __unbuffered_p1_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L790] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EAX = y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L793] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 __assert_fail ("0", "rfi004.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 14 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=6, InterpolantAutomatonStates: 46, 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.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:29:17,172 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/current/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-wmm/rfi004.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 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:29:19,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:29:19,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:29:19,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:29:19,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:29:19,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:29:19,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:29:19,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:29:19,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:29:19,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:29:19,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:29:19,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:29:19,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:29:19,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:29:19,534 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:29:19,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:29:19,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:29:19,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:29:19,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:29:19,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:29:19,536 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:29:19,540 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:29:19,541 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:29:19,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:29:19,541 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:29:19,542 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:29:19,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:29:19,542 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:29:19,543 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:29:19,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:29:19,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:29:19,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:29:19,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:29:19,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:29:19,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:29:19,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:29:19,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:29:19,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:29:19,546 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:29:19,547 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:29:19,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:29:19,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:29:19,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:29:19,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:29:19,550 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 -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 [2024-11-22 21:29:19,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:29:19,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:29:19,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:29:19,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:29:19,929 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:29:19,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi004.i [2024-11-22 21:29:21,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:29:21,792 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:29:21,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi004.i [2024-11-22 21:29:21,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ecd561c/f199eab097e24364ae08eccfb5a5ab73/FLAG302121cd8 [2024-11-22 21:29:21,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ecd561c/f199eab097e24364ae08eccfb5a5ab73 [2024-11-22 21:29:21,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:29:21,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:29:21,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:29:21,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:29:21,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:29:21,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:29:21" (1/1) ... [2024-11-22 21:29:21,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476790cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:21, skipping insertion in model container [2024-11-22 21:29:21,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:29:21" (1/1) ... [2024-11-22 21:29:21,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:29:22,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:29:22,304 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:29:22,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:29:22,436 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:29:22,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22 WrapperNode [2024-11-22 21:29:22,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:29:22,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:29:22,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:29:22,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:29:22,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,495 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 117 [2024-11-22 21:29:22,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:29:22,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:29:22,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:29:22,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:29:22,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,537 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-22 21:29:22,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:29:22,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:29:22,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:29:22,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:29:22,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (1/1) ... [2024-11-22 21:29:22,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:29:22,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:29:22,608 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-22 21:29:22,615 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-22 21:29:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:29:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:29:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:29:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:29:22,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:29:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:29:22,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:29:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:29:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:29:22,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:29:22,665 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:29:22,839 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:29:22,841 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:29:23,177 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:29:23,180 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:29:23,400 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:29:23,401 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:29:23,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:29:23 BoogieIcfgContainer [2024-11-22 21:29:23,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:29:23,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:29:23,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:29:23,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:29:23,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:29:21" (1/3) ... [2024-11-22 21:29:23,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348fb82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:29:23, skipping insertion in model container [2024-11-22 21:29:23,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:22" (2/3) ... [2024-11-22 21:29:23,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348fb82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:29:23, skipping insertion in model container [2024-11-22 21:29:23,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:29:23" (3/3) ... [2024-11-22 21:29:23,412 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2024-11-22 21:29:23,430 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:29:23,431 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:29:23,432 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:29:23,500 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:29:23,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 84 flow [2024-11-22 21:29:23,565 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2024-11-22 21:29:23,566 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:29:23,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 2/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2024-11-22 21:29:23,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 84 flow [2024-11-22 21:29:23,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 36 transitions, 78 flow [2024-11-22 21:29:23,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:29:23,596 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;@65fa03b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:29:23,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-22 21:29:23,605 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:29:23,605 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-22 21:29:23,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:29:23,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:23,606 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:29:23,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:23,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1781720299, now seen corresponding path program 1 times [2024-11-22 21:29:23,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:29:23,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798298165] [2024-11-22 21:29:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:29:23,625 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-22 21:29:23,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:29:23,627 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-22 21:29:23,628 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-22 21:29:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:29:23,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:29:23,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:29:23,770 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-22 21:29:23,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:29:23,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:29:23,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798298165] [2024-11-22 21:29:23,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798298165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:23,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:23,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:29:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882262647] [2024-11-22 21:29:23,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:23,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:29:23,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:29:23,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:29:23,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:29:23,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 38 [2024-11-22 21:29:23,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-22 21:29:23,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:23,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 38 [2024-11-22 21:29:23,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:24,041 INFO L124 PetriNetUnfolderBase]: 129/354 cut-off events. [2024-11-22 21:29:24,042 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:29:24,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 354 events. 129/354 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2050 event pairs, 18 based on Foata normal form. 24/370 useless extension candidates. Maximal degree in co-relation 588. Up to 184 conditions per place. [2024-11-22 21:29:24,055 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 21 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-11-22 21:29:24,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 138 flow [2024-11-22 21:29:24,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:29:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:29:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-22 21:29:24,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2024-11-22 21:29:24,070 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 78 flow. Second operand 3 states and 84 transitions. [2024-11-22 21:29:24,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 138 flow [2024-11-22 21:29:24,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:29:24,076 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2024-11-22 21:29:24,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-11-22 21:29:24,084 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2024-11-22 21:29:24,084 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2024-11-22 21:29:24,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-22 21:29:24,085 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:24,085 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:24,090 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-22 21:29:24,288 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-22 21:29:24,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:24,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash 221624674, now seen corresponding path program 1 times [2024-11-22 21:29:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:29:24,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601603] [2024-11-22 21:29:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:29:24,291 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-22 21:29:24,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:29:24,293 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-22 21:29:24,294 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-22 21:29:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:29:24,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:29:24,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:29:24,464 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-22 21:29:24,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:29:24,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:29:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601603] [2024-11-22 21:29:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:24,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:24,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:29:24,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088780809] [2024-11-22 21:29:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:24,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:29:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:29:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:29:24,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:29:24,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-11-22 21:29:24,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-22 21:29:24,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:24,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-11-22 21:29:24,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:24,675 INFO L124 PetriNetUnfolderBase]: 180/415 cut-off events. [2024-11-22 21:29:24,675 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-22 21:29:24,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 415 events. 180/415 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2183 event pairs, 24 based on Foata normal form. 20/424 useless extension candidates. Maximal degree in co-relation 776. Up to 199 conditions per place. [2024-11-22 21:29:24,679 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 29 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2024-11-22 21:29:24,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 176 flow [2024-11-22 21:29:24,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:29:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:29:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-11-22 21:29:24,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2024-11-22 21:29:24,681 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 4 states and 96 transitions. [2024-11-22 21:29:24,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 176 flow [2024-11-22 21:29:24,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:29:24,684 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 92 flow [2024-11-22 21:29:24,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2024-11-22 21:29:24,685 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2024-11-22 21:29:24,685 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 92 flow [2024-11-22 21:29:24,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-22 21:29:24,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:24,686 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:24,691 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-22 21:29:24,891 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-22 21:29:24,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:24,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash 94826433, now seen corresponding path program 1 times [2024-11-22 21:29:24,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:29:24,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847929104] [2024-11-22 21:29:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:29:24,893 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-22 21:29:24,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:29:24,896 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-22 21:29:24,898 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-22 21:29:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:29:25,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:29:25,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:29:25,064 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-22 21:29:25,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:29:25,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:29:25,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847929104] [2024-11-22 21:29:25,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847929104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:25,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:25,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:29:25,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89698164] [2024-11-22 21:29:25,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:25,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:29:25,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:29:25,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:29:25,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:29:25,072 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-11-22 21:29:25,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-22 21:29:25,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:25,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-11-22 21:29:25,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:25,192 INFO L124 PetriNetUnfolderBase]: 88/207 cut-off events. [2024-11-22 21:29:25,192 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-22 21:29:25,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 207 events. 88/207 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 727 event pairs, 16 based on Foata normal form. 14/212 useless extension candidates. Maximal degree in co-relation 458. Up to 71 conditions per place. [2024-11-22 21:29:25,194 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 25 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2024-11-22 21:29:25,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 185 flow [2024-11-22 21:29:25,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:29:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:29:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-11-22 21:29:25,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5736842105263158 [2024-11-22 21:29:25,196 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 92 flow. Second operand 5 states and 109 transitions. [2024-11-22 21:29:25,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 185 flow [2024-11-22 21:29:25,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 21:29:25,199 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 108 flow [2024-11-22 21:29:25,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-11-22 21:29:25,203 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2024-11-22 21:29:25,204 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 108 flow [2024-11-22 21:29:25,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-22 21:29:25,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:25,205 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:25,209 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-22 21:29:25,408 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-22 21:29:25,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:25,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1138402912, now seen corresponding path program 1 times [2024-11-22 21:29:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:29:25,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994576795] [2024-11-22 21:29:25,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:29:25,410 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-22 21:29:25,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:29:25,413 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-22 21:29:25,414 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-22 21:29:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:29:25,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:29:25,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:29:25,574 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-22 21:29:25,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:29:25,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:29:25,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994576795] [2024-11-22 21:29:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994576795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:25,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:25,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:29:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78196612] [2024-11-22 21:29:25,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:25,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:29:25,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:29:25,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:29:25,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:29:25,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-22 21:29:25,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-22 21:29:25,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:25,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-22 21:29:25,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:25,649 INFO L124 PetriNetUnfolderBase]: 49/143 cut-off events. [2024-11-22 21:29:25,649 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-22 21:29:25,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 143 events. 49/143 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 482 event pairs, 48 based on Foata normal form. 4/132 useless extension candidates. Maximal degree in co-relation 284. Up to 101 conditions per place. [2024-11-22 21:29:25,652 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 13 selfloop transitions, 1 changer transitions 1/32 dead transitions. [2024-11-22 21:29:25,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 136 flow [2024-11-22 21:29:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:29:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:29:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-22 21:29:25,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5877192982456141 [2024-11-22 21:29:25,655 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 108 flow. Second operand 3 states and 67 transitions. [2024-11-22 21:29:25,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 136 flow [2024-11-22 21:29:25,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 108 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-22 21:29:25,658 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 78 flow [2024-11-22 21:29:25,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2024-11-22 21:29:25,660 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2024-11-22 21:29:25,660 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 78 flow [2024-11-22 21:29:25,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-22 21:29:25,661 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:25,661 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:25,668 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-22 21:29:25,862 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-22 21:29:25,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:25,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1138402929, now seen corresponding path program 1 times [2024-11-22 21:29:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:29:25,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037786492] [2024-11-22 21:29:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:29:25,864 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-22 21:29:25,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:29:25,866 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-22 21:29:25,867 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-22 21:29:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:29:25,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:29:25,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:29:26,110 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-22 21:29:26,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:29:26,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:29:26,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037786492] [2024-11-22 21:29:26,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037786492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:26,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:26,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:29:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682004905] [2024-11-22 21:29:26,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:26,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:29:26,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:29:26,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:29:26,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:29:26,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-11-22 21:29:26,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-22 21:29:26,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:26,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-11-22 21:29:26,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:26,293 INFO L124 PetriNetUnfolderBase]: 108/284 cut-off events. [2024-11-22 21:29:26,293 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:29:26,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 284 events. 108/284 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1143 event pairs, 30 based on Foata normal form. 4/279 useless extension candidates. Maximal degree in co-relation 529. Up to 118 conditions per place. [2024-11-22 21:29:26,296 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 19 selfloop transitions, 1 changer transitions 17/51 dead transitions. [2024-11-22 21:29:26,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 194 flow [2024-11-22 21:29:26,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:29:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:29:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2024-11-22 21:29:26,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2024-11-22 21:29:26,298 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 78 flow. Second operand 6 states and 128 transitions. [2024-11-22 21:29:26,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 194 flow [2024-11-22 21:29:26,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:29:26,299 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 88 flow [2024-11-22 21:29:26,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2024-11-22 21:29:26,300 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2024-11-22 21:29:26,300 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 88 flow [2024-11-22 21:29:26,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-22 21:29:26,302 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:26,302 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:26,307 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-22 21:29:26,503 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-22 21:29:26,504 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:26,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash 552810043, now seen corresponding path program 2 times [2024-11-22 21:29:26,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:29:26,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211474214] [2024-11-22 21:29:26,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:29:26,505 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-22 21:29:26,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:29:26,507 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-22 21:29:26,508 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-22 21:29:26,591 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:29:26,591 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:29:26,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 21:29:26,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:29:26,877 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-22 21:29:26,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:29:26,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:29:26,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211474214] [2024-11-22 21:29:26,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211474214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:29:26,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:29:26,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:29:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703638673] [2024-11-22 21:29:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:29:26,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 21:29:26,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:29:26,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 21:29:26,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 21:29:26,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-22 21:29:26,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 88 flow. Second operand has 8 states, 8 states have (on average 18.625) internal successors, (149), 8 states have internal predecessors, (149), 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-22 21:29:26,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:29:26,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-22 21:29:26,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:29:27,098 INFO L124 PetriNetUnfolderBase]: 77/225 cut-off events. [2024-11-22 21:29:27,098 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-22 21:29:27,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 225 events. 77/225 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 891 event pairs, 20 based on Foata normal form. 4/217 useless extension candidates. Maximal degree in co-relation 431. Up to 51 conditions per place. [2024-11-22 21:29:27,100 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 16 selfloop transitions, 4 changer transitions 15/51 dead transitions. [2024-11-22 21:29:27,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 202 flow [2024-11-22 21:29:27,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:29:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 21:29:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2024-11-22 21:29:27,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2024-11-22 21:29:27,102 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 88 flow. Second operand 9 states and 189 transitions. [2024-11-22 21:29:27,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 202 flow [2024-11-22 21:29:27,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 191 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:29:27,104 INFO L231 Difference]: Finished difference. Result has 52 places, 31 transitions, 99 flow [2024-11-22 21:29:27,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=99, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2024-11-22 21:29:27,105 INFO L277 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2024-11-22 21:29:27,105 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 31 transitions, 99 flow [2024-11-22 21:29:27,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.625) internal successors, (149), 8 states have internal predecessors, (149), 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-22 21:29:27,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:29:27,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:29:27,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-22 21:29:27,306 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-22 21:29:27,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-22 21:29:27,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:29:27,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1474168011, now seen corresponding path program 3 times [2024-11-22 21:29:27,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:29:27,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523400412] [2024-11-22 21:29:27,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:29:27,308 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-22 21:29:27,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:29:27,310 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-22 21:29:27,311 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-22 21:29:27,382 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:29:27,382 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:29:27,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:29:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:29:27,487 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 21:29:27,487 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:29:27,488 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-22 21:29:27,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-22 21:29:27,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-22 21:29:27,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-22 21:29:27,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-22 21:29:27,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-22 21:29:27,499 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 (8)] Forceful destruction successful, exit code 0 [2024-11-22 21:29:27,695 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-22 21:29:27,695 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-22 21:29:27,772 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:29:27,772 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:29:27,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:29:27 BasicIcfg [2024-11-22 21:29:27,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:29:27,778 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:29:27,778 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:29:27,778 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:29:27,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:29:23" (3/4) ... [2024-11-22 21:29:27,780 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:29:27,782 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:29:27,783 INFO L158 Benchmark]: Toolchain (without parser) took 5957.29ms. Allocated memory was 56.6MB in the beginning and 132.1MB in the end (delta: 75.5MB). Free memory was 26.5MB in the beginning and 93.3MB in the end (delta: -66.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-22 21:29:27,783 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 41.9MB. Free memory was 23.2MB in the beginning and 23.2MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:29:27,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.11ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 26.3MB in the beginning and 42.6MB in the end (delta: -16.3MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-22 21:29:27,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.03ms. Allocated memory is still 69.2MB. Free memory was 42.6MB in the beginning and 40.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:29:27,784 INFO L158 Benchmark]: Boogie Preprocessor took 70.21ms. Allocated memory is still 69.2MB. Free memory was 40.3MB in the beginning and 37.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:29:27,784 INFO L158 Benchmark]: RCFGBuilder took 833.79ms. Allocated memory is still 69.2MB. Free memory was 37.1MB in the beginning and 34.3MB in the end (delta: 2.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-22 21:29:27,785 INFO L158 Benchmark]: TraceAbstraction took 4373.39ms. Allocated memory was 69.2MB in the beginning and 132.1MB in the end (delta: 62.9MB). Free memory was 33.6MB in the beginning and 93.3MB in the end (delta: -59.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-22 21:29:27,785 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 132.1MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:29:27,788 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.94ms. Allocated memory is still 41.9MB. Free memory was 23.2MB in the beginning and 23.2MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.11ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 26.3MB in the beginning and 42.6MB in the end (delta: -16.3MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.03ms. Allocated memory is still 69.2MB. Free memory was 42.6MB in the beginning and 40.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.21ms. Allocated memory is still 69.2MB. Free memory was 40.3MB in the beginning and 37.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 833.79ms. Allocated memory is still 69.2MB. Free memory was 37.1MB in the beginning and 34.3MB in the end (delta: 2.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4373.39ms. Allocated memory was 69.2MB in the beginning and 132.1MB in the end (delta: 62.9MB). Free memory was 33.6MB in the beginning and 93.3MB in the end (delta: -59.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 132.1MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1649; [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1649=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1650; [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1649=-1, t1650=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L787] 2 __unbuffered_p1_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L790] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EAX = y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L793] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-1, t1650=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-1, t1650=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-1, t1650=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 __assert_fail ("0", "rfi004.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 454 IncrementalHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1 mSDtfsCounter, 454 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=3, InterpolantAutomatonStates: 30, 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.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 397 SizeOfPredicates, 9 NumberOfNonLiveVariables, 543 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:29:27,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