./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.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 f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:25:40,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:25:40,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:25:40,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:25:40,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:25:40,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:25:40,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:25:40,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:25:40,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:25:40,756 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:25:40,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:25:40,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:25:40,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:25:40,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:25:40,758 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:25:40,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:25:40,759 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:25:40,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:25:40,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:25:40,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:25:40,761 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:25:40,761 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:25:40,762 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:25:40,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:25:40,766 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:25:40,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:25:40,767 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:25:40,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:25:40,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:25:40,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:25:40,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:25:40,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:25:40,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:25:40,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:25:40,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:25:40,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:25:40,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:25:40,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:25:40,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:25:40,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:25:40,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:25:40,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:25:40,787 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 -> f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29 [2024-10-13 12:25:41,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:25:41,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:25:41,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:25:41,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:25:41,082 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:25:41,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.i [2024-10-13 12:25:42,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:25:42,909 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:25:42,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.i [2024-10-13 12:25:42,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f976f99/190a00aa1939476ebb70f9b0803b8be6/FLAGf7c5cdd18 [2024-10-13 12:25:42,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f976f99/190a00aa1939476ebb70f9b0803b8be6 [2024-10-13 12:25:42,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:25:42,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:25:42,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:25:42,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:25:42,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:25:42,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:25:42" (1/1) ... [2024-10-13 12:25:42,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d61b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:42, skipping insertion in model container [2024-10-13 12:25:42,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:25:42" (1/1) ... [2024-10-13 12:25:42,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:25:43,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:25:43,373 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:25:43,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:25:43,474 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:25:43,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43 WrapperNode [2024-10-13 12:25:43,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:25:43,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:25:43,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:25:43,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:25:43,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,532 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 116 [2024-10-13 12:25:43,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:25:43,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:25:43,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:25:43,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:25:43,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,570 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-10-13 12:25:43,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:25:43,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:25:43,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:25:43,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:25:43,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (1/1) ... [2024-10-13 12:25:43,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:25:43,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:25:43,637 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-10-13 12:25:43,643 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-10-13 12:25:43,696 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2024-10-13 12:25:43,696 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2024-10-13 12:25:43,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:25:43,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:25:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:25:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:25:43,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:25:43,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:25:43,699 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:25:43,824 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:25:43,826 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:25:44,002 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:25:44,003 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:25:44,137 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:25:44,138 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:25:44,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:25:44 BoogieIcfgContainer [2024-10-13 12:25:44,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:25:44,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:25:44,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:25:44,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:25:44,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:25:42" (1/3) ... [2024-10-13 12:25:44,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654ae06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:25:44, skipping insertion in model container [2024-10-13 12:25:44,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:43" (2/3) ... [2024-10-13 12:25:44,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654ae06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:25:44, skipping insertion in model container [2024-10-13 12:25:44,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:25:44" (3/3) ... [2024-10-13 12:25:44,149 INFO L112 eAbstractionObserver]: Analyzing ICFG qw2004-2b.i [2024-10-13 12:25:44,166 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:25:44,167 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:25:44,167 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:25:44,197 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:25:44,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 45 transitions, 94 flow [2024-10-13 12:25:44,252 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2024-10-13 12:25:44,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:44,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 44 events. 6/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-10-13 12:25:44,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 45 transitions, 94 flow [2024-10-13 12:25:44,261 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 44 transitions, 91 flow [2024-10-13 12:25:44,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:25:44,285 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;@13dfcac2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:25:44,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-13 12:25:44,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:25:44,296 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2024-10-13 12:25:44,297 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:44,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:44,298 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:44,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:44,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:44,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1862257886, now seen corresponding path program 1 times [2024-10-13 12:25:44,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:25:44,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042638386] [2024-10-13 12:25:44,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:25:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:25:44,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042638386] [2024-10-13 12:25:44,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042638386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:44,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:44,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:25:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500084499] [2024-10-13 12:25:44,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:44,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:25:44,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:25:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:25:44,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:25:44,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-10-13 12:25:44,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 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-10-13 12:25:44,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:44,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-10-13 12:25:44,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:44,896 INFO L124 PetriNetUnfolderBase]: 109/314 cut-off events. [2024-10-13 12:25:44,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:44,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 314 events. 109/314 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1536 event pairs, 50 based on Foata normal form. 14/297 useless extension candidates. Maximal degree in co-relation 509. Up to 149 conditions per place. [2024-10-13 12:25:44,906 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 36 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2024-10-13 12:25:44,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 213 flow [2024-10-13 12:25:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:25:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:25:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-10-13 12:25:44,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6622222222222223 [2024-10-13 12:25:44,925 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 91 flow. Second operand 5 states and 149 transitions. [2024-10-13 12:25:44,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 213 flow [2024-10-13 12:25:44,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:25:44,932 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 132 flow [2024-10-13 12:25:44,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-10-13 12:25:44,943 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-10-13 12:25:44,943 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 132 flow [2024-10-13 12:25:44,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 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-10-13 12:25:44,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:44,944 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:44,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:25:44,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:44,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:44,946 INFO L85 PathProgramCache]: Analyzing trace with hash -528428639, now seen corresponding path program 1 times [2024-10-13 12:25:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:25:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479955199] [2024-10-13 12:25:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:25:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:45,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:25:45,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479955199] [2024-10-13 12:25:45,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479955199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:45,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:45,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:25:45,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399996492] [2024-10-13 12:25:45,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:45,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:25:45,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:25:45,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:25:45,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:25:45,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2024-10-13 12:25:45,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-10-13 12:25:45,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:45,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2024-10-13 12:25:45,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:45,223 INFO L124 PetriNetUnfolderBase]: 125/359 cut-off events. [2024-10-13 12:25:45,226 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-10-13 12:25:45,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 359 events. 125/359 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1883 event pairs, 54 based on Foata normal form. 6/340 useless extension candidates. Maximal degree in co-relation 638. Up to 158 conditions per place. [2024-10-13 12:25:45,233 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 34 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2024-10-13 12:25:45,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 236 flow [2024-10-13 12:25:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:25:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:25:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-10-13 12:25:45,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-10-13 12:25:45,236 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 132 flow. Second operand 4 states and 125 transitions. [2024-10-13 12:25:45,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 236 flow [2024-10-13 12:25:45,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:25:45,239 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 146 flow [2024-10-13 12:25:45,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-10-13 12:25:45,240 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2024-10-13 12:25:45,241 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 146 flow [2024-10-13 12:25:45,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-10-13 12:25:45,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:45,241 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:45,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:25:45,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:45,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:45,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1052517977, now seen corresponding path program 1 times [2024-10-13 12:25:45,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:25:45,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775557780] [2024-10-13 12:25:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:45,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:25:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:25:45,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775557780] [2024-10-13 12:25:45,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775557780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:45,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:45,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:25:45,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121846125] [2024-10-13 12:25:45,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:45,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:25:45,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:25:45,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:25:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:25:45,318 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2024-10-13 12:25:45,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-13 12:25:45,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:45,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2024-10-13 12:25:45,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:45,386 INFO L124 PetriNetUnfolderBase]: 122/339 cut-off events. [2024-10-13 12:25:45,386 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2024-10-13 12:25:45,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 339 events. 122/339 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1727 event pairs, 84 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 638. Up to 223 conditions per place. [2024-10-13 12:25:45,390 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 19 selfloop transitions, 1 changer transitions 2/46 dead transitions. [2024-10-13 12:25:45,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 46 transitions, 188 flow [2024-10-13 12:25:45,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:25:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:25:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-10-13 12:25:45,393 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6370370370370371 [2024-10-13 12:25:45,393 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 146 flow. Second operand 3 states and 86 transitions. [2024-10-13 12:25:45,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 46 transitions, 188 flow [2024-10-13 12:25:45,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 185 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 12:25:45,398 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 133 flow [2024-10-13 12:25:45,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-10-13 12:25:45,401 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2024-10-13 12:25:45,401 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 133 flow [2024-10-13 12:25:45,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-13 12:25:45,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:45,403 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:45,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:25:45,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:45,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash 323422042, now seen corresponding path program 1 times [2024-10-13 12:25:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:25:45,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004215308] [2024-10-13 12:25:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:25:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:45,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:25:45,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004215308] [2024-10-13 12:25:45,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004215308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:45,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:45,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:25:45,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817534491] [2024-10-13 12:25:45,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:45,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:25:45,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:25:45,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:25:45,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:25:45,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-10-13 12:25:45,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-10-13 12:25:45,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:45,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-10-13 12:25:45,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:45,720 INFO L124 PetriNetUnfolderBase]: 108/277 cut-off events. [2024-10-13 12:25:45,721 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-10-13 12:25:45,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 277 events. 108/277 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1188 event pairs, 38 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 549. Up to 111 conditions per place. [2024-10-13 12:25:45,724 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 29 selfloop transitions, 5 changer transitions 18/73 dead transitions. [2024-10-13 12:25:45,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 306 flow [2024-10-13 12:25:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:25:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:25:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2024-10-13 12:25:45,729 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2024-10-13 12:25:45,729 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 133 flow. Second operand 8 states and 213 transitions. [2024-10-13 12:25:45,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 306 flow [2024-10-13 12:25:45,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 299 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-13 12:25:45,734 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 164 flow [2024-10-13 12:25:45,734 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=164, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2024-10-13 12:25:45,735 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2024-10-13 12:25:45,735 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 164 flow [2024-10-13 12:25:45,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-10-13 12:25:45,735 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:45,736 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] [2024-10-13 12:25:45,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:25:45,736 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:45,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:45,738 INFO L85 PathProgramCache]: Analyzing trace with hash 494376896, now seen corresponding path program 1 times [2024-10-13 12:25:45,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:25:45,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374342770] [2024-10-13 12:25:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:25:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:45,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:25:45,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374342770] [2024-10-13 12:25:45,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374342770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:45,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:45,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:25:45,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233410420] [2024-10-13 12:25:45,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:45,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:25:45,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:25:45,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:25:45,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:25:45,823 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-10-13 12:25:45,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:25:45,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:45,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-10-13 12:25:45,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:45,984 INFO L124 PetriNetUnfolderBase]: 129/348 cut-off events. [2024-10-13 12:25:45,985 INFO L125 PetriNetUnfolderBase]: For 137/144 co-relation queries the response was YES. [2024-10-13 12:25:45,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 348 events. 129/348 cut-off events. For 137/144 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1744 event pairs, 31 based on Foata normal form. 23/354 useless extension candidates. Maximal degree in co-relation 750. Up to 146 conditions per place. [2024-10-13 12:25:45,988 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 16 selfloop transitions, 2 changer transitions 42/77 dead transitions. [2024-10-13 12:25:45,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 370 flow [2024-10-13 12:25:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:25:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:25:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-10-13 12:25:46,013 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2024-10-13 12:25:46,014 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 164 flow. Second operand 5 states and 155 transitions. [2024-10-13 12:25:46,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 370 flow [2024-10-13 12:25:46,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 358 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-13 12:25:46,021 INFO L231 Difference]: Finished difference. Result has 62 places, 32 transitions, 123 flow [2024-10-13 12:25:46,021 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=62, PETRI_TRANSITIONS=32} [2024-10-13 12:25:46,022 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2024-10-13 12:25:46,023 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 32 transitions, 123 flow [2024-10-13 12:25:46,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:25:46,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:46,024 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-10-13 12:25:46,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:25:46,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:46,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:46,029 INFO L85 PathProgramCache]: Analyzing trace with hash -653373087, now seen corresponding path program 1 times [2024-10-13 12:25:46,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:25:46,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657642333] [2024-10-13 12:25:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:46,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:25:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:46,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:25:46,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657642333] [2024-10-13 12:25:46,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657642333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:46,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:46,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:25:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838457205] [2024-10-13 12:25:46,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:46,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:25:46,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:25:46,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:25:46,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:25:46,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-10-13 12:25:46,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 32 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-10-13 12:25:46,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:46,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-10-13 12:25:46,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:46,356 INFO L124 PetriNetUnfolderBase]: 78/241 cut-off events. [2024-10-13 12:25:46,357 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-10-13 12:25:46,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 241 events. 78/241 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1092 event pairs, 28 based on Foata normal form. 3/242 useless extension candidates. Maximal degree in co-relation 533. Up to 97 conditions per place. [2024-10-13 12:25:46,359 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 34 selfloop transitions, 6 changer transitions 15/70 dead transitions. [2024-10-13 12:25:46,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 337 flow [2024-10-13 12:25:46,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:25:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:25:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 265 transitions. [2024-10-13 12:25:46,361 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2024-10-13 12:25:46,361 INFO L175 Difference]: Start difference. First operand has 62 places, 32 transitions, 123 flow. Second operand 11 states and 265 transitions. [2024-10-13 12:25:46,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 337 flow [2024-10-13 12:25:46,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 296 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-10-13 12:25:46,364 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 151 flow [2024-10-13 12:25:46,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=151, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2024-10-13 12:25:46,365 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2024-10-13 12:25:46,365 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 151 flow [2024-10-13 12:25:46,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-10-13 12:25:46,366 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:46,366 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-10-13 12:25:46,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:25:46,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:46,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:46,367 INFO L85 PathProgramCache]: Analyzing trace with hash 729518559, now seen corresponding path program 2 times [2024-10-13 12:25:46,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:25:46,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608227349] [2024-10-13 12:25:46,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:46,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:25:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:25:46,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:25:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:25:46,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:25:46,423 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:25:46,424 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2024-10-13 12:25:46,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2024-10-13 12:25:46,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-13 12:25:46,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:25:46,429 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-10-13 12:25:46,477 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:25:46,478 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:25:46,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:25:46 BasicIcfg [2024-10-13 12:25:46,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:25:46,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:25:46,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:25:46,485 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:25:46,485 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:25:44" (3/4) ... [2024-10-13 12:25:46,487 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:25:46,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:25:46,489 INFO L158 Benchmark]: Toolchain (without parser) took 3548.97ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 116.2MB in the beginning and 164.0MB in the end (delta: -47.8MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2024-10-13 12:25:46,490 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 174.1MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:25:46,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.26ms. Allocated memory is still 174.1MB. Free memory was 116.2MB in the beginning and 94.5MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 12:25:46,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.10ms. Allocated memory is still 174.1MB. Free memory was 94.5MB in the beginning and 92.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:25:46,493 INFO L158 Benchmark]: Boogie Preprocessor took 60.18ms. Allocated memory is still 174.1MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:25:46,493 INFO L158 Benchmark]: RCFGBuilder took 543.41ms. Allocated memory is still 174.1MB. Free memory was 89.8MB in the beginning and 64.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 12:25:46,493 INFO L158 Benchmark]: TraceAbstraction took 2343.03ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 63.8MB in the beginning and 164.0MB in the end (delta: -100.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:25:46,493 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 255.9MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:25:46,495 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.12ms. Allocated memory is still 174.1MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.26ms. Allocated memory is still 174.1MB. Free memory was 116.2MB in the beginning and 94.5MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.10ms. Allocated memory is still 174.1MB. Free memory was 94.5MB in the beginning and 92.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.18ms. Allocated memory is still 174.1MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.41ms. Allocated memory is still 174.1MB. Free memory was 89.8MB in the beginning and 64.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2343.03ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 63.8MB in the beginning and 164.0MB in the end (delta: -100.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 255.9MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 683]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 683. Possible FailurePath: [L697] 0 volatile int stoppingFlag; [L698] 0 volatile int pendingIo; [L699] 0 volatile int stoppingEvent; [L700] 0 volatile int stopped; [L756] 0 pthread_t t; [L757] 0 pendingIo = 1 [L758] 0 stoppingFlag = 0 [L759] 0 stoppingEvent = 0 [L760] 0 stopped = 0 [L761] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L762] CALL 0 BCSP_PnpAdd(0) [L734] 0 int status; [L735] CALL, EXPR 0 BCSP_IoIncrement() [L703] 0 int lsf = stoppingFlag; VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L745] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L705] COND FALSE 0 !(\read(lsf)) VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L747] CALL 1 BCSP_IoDecrement() [L725] 1 int pending; [L726] CALL, EXPR 1 dec() [L709] 0 int lp = pendingIo; VAL [lp=1, lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L719] 1 pendingIo-- [L720] 1 int tmp = pendingIo; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L722] 1 return tmp; [L726] RET, EXPR 1 dec() [L726] 1 pending = dec() [L727] COND TRUE 1 pending == 0 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L729] 1 stoppingEvent = 1 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L747] RET 1 BCSP_IoDecrement() [L712] 0 pendingIo = lp + 1 VAL [lp=1, lsf=0, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1] [L749] 1 int lse = stoppingEvent; VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1] [L751] CALL 1 assume_abort_if_not(lse) [L686] COND FALSE 1 !(!cond) [L751] RET 1 assume_abort_if_not(lse) [L715] 0 return 0; VAL [\result=0, lsf=0, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1] [L735] RET, EXPR 0 BCSP_IoIncrement() [L735] 0 status = BCSP_IoIncrement() [L736] COND TRUE 0 status == 0 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L752] 1 stopped = 1 VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L737] 0 int local_assertion = !stopped; VAL [\old(arg)={0:0}, arg={0:0}, local_assertion=0, pendingIo=2, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L738] CALL 0 __VERIFIER_assert(local_assertion) [L689] COND TRUE 0 !(cond) [L690] CALL 0 reach_error() [L683] COND FALSE 0 !(0) VAL [pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L683] 0 __assert_fail ("0", "assert.h", 6, __extension__ __PRETTY_FUNCTION__) VAL [pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] - UnprovableResult [Line: 755]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: 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 3 procedures, 54 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 539 IncrementalHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 12 mSDtfsCounter, 539 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-10-13 12:25:46,524 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.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 f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:25:48,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:25:48,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:25:48,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:25:48,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:25:48,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:25:48,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:25:48,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:25:48,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:25:48,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:25:48,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:25:48,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:25:48,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:25:48,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:25:48,928 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:25:48,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:25:48,929 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:25:48,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:25:48,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:25:48,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:25:48,935 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:25:48,935 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:25:48,936 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:25:48,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:25:48,936 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:25:48,937 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:25:48,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:25:48,937 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:25:48,938 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:25:48,938 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:25:48,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:25:48,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:25:48,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:25:48,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:25:48,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:25:48,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:25:48,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:25:48,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:25:48,948 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:25:48,949 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:25:48,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:25:48,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:25:48,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:25:48,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:25:48,950 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:25:48,950 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 -> f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29 [2024-10-13 12:25:49,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:25:49,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:25:49,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:25:49,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:25:49,343 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:25:49,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.i [2024-10-13 12:25:50,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:25:51,180 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:25:51,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.i [2024-10-13 12:25:51,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc5512d11/15319c8cf85e409a963a4508e836087d/FLAG0c1d65937 [2024-10-13 12:25:51,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc5512d11/15319c8cf85e409a963a4508e836087d [2024-10-13 12:25:51,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:25:51,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:25:51,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:25:51,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:25:51,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:25:51,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:25:51" (1/1) ... [2024-10-13 12:25:51,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e23a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:51, skipping insertion in model container [2024-10-13 12:25:51,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:25:51" (1/1) ... [2024-10-13 12:25:51,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:25:51,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:25:51,944 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:25:52,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:25:52,073 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:25:52,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52 WrapperNode [2024-10-13 12:25:52,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:25:52,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:25:52,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:25:52,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:25:52,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,134 INFO L138 Inliner]: procedures = 175, calls = 33, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 114 [2024-10-13 12:25:52,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:25:52,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:25:52,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:25:52,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:25:52,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,172 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-10-13 12:25:52,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:25:52,194 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:25:52,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:25:52,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:25:52,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (1/1) ... [2024-10-13 12:25:52,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:25:52,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:25:52,232 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-10-13 12:25:52,234 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-10-13 12:25:52,288 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2024-10-13 12:25:52,289 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2024-10-13 12:25:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:25:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:25:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:25:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:25:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:25:52,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:25:52,291 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:25:52,433 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:25:52,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:25:52,704 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:25:52,704 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:25:52,881 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:25:52,881 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:25:52,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:25:52 BoogieIcfgContainer [2024-10-13 12:25:52,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:25:52,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:25:52,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:25:52,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:25:52,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:25:51" (1/3) ... [2024-10-13 12:25:52,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc6a6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:25:52, skipping insertion in model container [2024-10-13 12:25:52,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:25:52" (2/3) ... [2024-10-13 12:25:52,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc6a6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:25:52, skipping insertion in model container [2024-10-13 12:25:52,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:25:52" (3/3) ... [2024-10-13 12:25:52,891 INFO L112 eAbstractionObserver]: Analyzing ICFG qw2004-2b.i [2024-10-13 12:25:52,908 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:25:52,908 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:25:52,909 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:25:52,951 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:25:52,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 45 transitions, 94 flow [2024-10-13 12:25:53,031 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2024-10-13 12:25:53,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:53,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 44 events. 6/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-10-13 12:25:53,038 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 45 transitions, 94 flow [2024-10-13 12:25:53,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 44 transitions, 91 flow [2024-10-13 12:25:53,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:25:53,061 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;@3b1258e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:25:53,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-13 12:25:53,074 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:25:53,074 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2024-10-13 12:25:53,074 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:53,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:53,075 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:53,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:53,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:53,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2109468638, now seen corresponding path program 1 times [2024-10-13 12:25:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:53,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45033026] [2024-10-13 12:25:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:53,096 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-10-13 12:25:53,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:53,100 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-10-13 12:25:53,102 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-10-13 12:25:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:53,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:25:53,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:53,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:53,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:53,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45033026] [2024-10-13 12:25:53,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45033026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:53,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:53,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:25:53,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858437000] [2024-10-13 12:25:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:53,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:25:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:53,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:25:53,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:25:53,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-10-13 12:25:53,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 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-10-13 12:25:53,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:53,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-10-13 12:25:53,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:53,511 INFO L124 PetriNetUnfolderBase]: 109/314 cut-off events. [2024-10-13 12:25:53,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:25:53,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 314 events. 109/314 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1523 event pairs, 55 based on Foata normal form. 14/297 useless extension candidates. Maximal degree in co-relation 509. Up to 149 conditions per place. [2024-10-13 12:25:53,519 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 36 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2024-10-13 12:25:53,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 213 flow [2024-10-13 12:25:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:25:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:25:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-10-13 12:25:53,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6622222222222223 [2024-10-13 12:25:53,531 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 91 flow. Second operand 5 states and 149 transitions. [2024-10-13 12:25:53,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 213 flow [2024-10-13 12:25:53,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:25:53,537 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 132 flow [2024-10-13 12:25:53,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-10-13 12:25:53,542 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-10-13 12:25:53,544 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 132 flow [2024-10-13 12:25:53,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 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-10-13 12:25:53,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:53,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:53,550 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 (2)] Ended with exit code 0 [2024-10-13 12:25:53,748 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-10-13 12:25:53,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:53,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:53,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1874760159, now seen corresponding path program 1 times [2024-10-13 12:25:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231916336] [2024-10-13 12:25:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:53,751 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-10-13 12:25:53,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:53,756 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-10-13 12:25:53,758 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-10-13 12:25:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:53,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:25:53,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:53,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-10-13 12:25:53,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:53,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:53,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231916336] [2024-10-13 12:25:53,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231916336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:53,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:53,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:25:53,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164598378] [2024-10-13 12:25:53,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:53,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:25:53,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:53,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:25:53,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:25:53,864 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2024-10-13 12:25:53,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-10-13 12:25:53,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:53,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2024-10-13 12:25:53,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:54,007 INFO L124 PetriNetUnfolderBase]: 125/359 cut-off events. [2024-10-13 12:25:54,008 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-10-13 12:25:54,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 359 events. 125/359 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1882 event pairs, 54 based on Foata normal form. 6/340 useless extension candidates. Maximal degree in co-relation 638. Up to 158 conditions per place. [2024-10-13 12:25:54,012 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 34 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2024-10-13 12:25:54,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 236 flow [2024-10-13 12:25:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:25:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:25:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-10-13 12:25:54,015 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-10-13 12:25:54,015 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 132 flow. Second operand 4 states and 125 transitions. [2024-10-13 12:25:54,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 236 flow [2024-10-13 12:25:54,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:25:54,020 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 146 flow [2024-10-13 12:25:54,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-10-13 12:25:54,021 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2024-10-13 12:25:54,021 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 146 flow [2024-10-13 12:25:54,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-10-13 12:25:54,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:54,022 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:54,029 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-10-13 12:25:54,222 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-10-13 12:25:54,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:54,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:54,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2029053483, now seen corresponding path program 1 times [2024-10-13 12:25:54,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:54,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705323763] [2024-10-13 12:25:54,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:54,225 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-10-13 12:25:54,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:54,236 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-10-13 12:25:54,237 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-10-13 12:25:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:54,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:25:54,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:54,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:54,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705323763] [2024-10-13 12:25:54,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705323763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:54,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:54,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:25:54,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920600166] [2024-10-13 12:25:54,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:54,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:25:54,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:54,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:25:54,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:25:54,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-10-13 12:25:54,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-10-13 12:25:54,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:54,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-10-13 12:25:54,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:54,491 INFO L124 PetriNetUnfolderBase]: 152/410 cut-off events. [2024-10-13 12:25:54,492 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-10-13 12:25:54,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 410 events. 152/410 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2196 event pairs, 69 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 800. Up to 241 conditions per place. [2024-10-13 12:25:54,496 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 39 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2024-10-13 12:25:54,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 300 flow [2024-10-13 12:25:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:25:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:25:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-10-13 12:25:54,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-10-13 12:25:54,499 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 146 flow. Second operand 5 states and 144 transitions. [2024-10-13 12:25:54,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 300 flow [2024-10-13 12:25:54,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 294 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-13 12:25:54,502 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 210 flow [2024-10-13 12:25:54,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-10-13 12:25:54,503 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2024-10-13 12:25:54,504 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 210 flow [2024-10-13 12:25:54,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-10-13 12:25:54,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:54,504 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:54,509 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-10-13 12:25:54,705 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-10-13 12:25:54,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:54,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1536817878, now seen corresponding path program 1 times [2024-10-13 12:25:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:54,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234981213] [2024-10-13 12:25:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:54,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:25:54,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:54,710 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-10-13 12:25:54,711 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-10-13 12:25:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:54,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:25:54,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:54,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:54,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:54,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234981213] [2024-10-13 12:25:54,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234981213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:54,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:54,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:25:54,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727314304] [2024-10-13 12:25:54,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:54,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:25:54,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:54,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:25:54,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:25:54,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-10-13 12:25:54,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-10-13 12:25:54,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:54,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-10-13 12:25:54,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:55,001 INFO L124 PetriNetUnfolderBase]: 149/406 cut-off events. [2024-10-13 12:25:55,001 INFO L125 PetriNetUnfolderBase]: For 233/238 co-relation queries the response was YES. [2024-10-13 12:25:55,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 406 events. 149/406 cut-off events. For 233/238 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2113 event pairs, 60 based on Foata normal form. 9/399 useless extension candidates. Maximal degree in co-relation 943. Up to 179 conditions per place. [2024-10-13 12:25:55,005 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 50 selfloop transitions, 9 changer transitions 1/85 dead transitions. [2024-10-13 12:25:55,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 438 flow [2024-10-13 12:25:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:25:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:25:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2024-10-13 12:25:55,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-10-13 12:25:55,009 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 210 flow. Second operand 7 states and 196 transitions. [2024-10-13 12:25:55,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 438 flow [2024-10-13 12:25:55,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:25:55,017 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 262 flow [2024-10-13 12:25:55,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2024-10-13 12:25:55,018 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2024-10-13 12:25:55,019 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 262 flow [2024-10-13 12:25:55,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-10-13 12:25:55,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:55,019 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:55,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 12:25:55,220 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-10-13 12:25:55,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:55,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1414651508, now seen corresponding path program 1 times [2024-10-13 12:25:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:55,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590814728] [2024-10-13 12:25:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:55,222 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-10-13 12:25:55,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:55,224 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-10-13 12:25:55,225 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-10-13 12:25:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:55,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:25:55,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:55,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:55,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:55,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590814728] [2024-10-13 12:25:55,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590814728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:55,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:55,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:25:55,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739097453] [2024-10-13 12:25:55,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:55,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:25:55,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:55,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:25:55,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:25:55,325 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2024-10-13 12:25:55,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-13 12:25:55,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:55,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2024-10-13 12:25:55,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:55,391 INFO L124 PetriNetUnfolderBase]: 127/363 cut-off events. [2024-10-13 12:25:55,392 INFO L125 PetriNetUnfolderBase]: For 230/231 co-relation queries the response was YES. [2024-10-13 12:25:55,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 363 events. 127/363 cut-off events. For 230/231 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1887 event pairs, 78 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 880. Up to 241 conditions per place. [2024-10-13 12:25:55,397 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 22 selfloop transitions, 1 changer transitions 11/60 dead transitions. [2024-10-13 12:25:55,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 60 transitions, 322 flow [2024-10-13 12:25:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:25:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:25:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-10-13 12:25:55,399 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6370370370370371 [2024-10-13 12:25:55,400 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 262 flow. Second operand 3 states and 86 transitions. [2024-10-13 12:25:55,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 60 transitions, 322 flow [2024-10-13 12:25:55,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 60 transitions, 322 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:25:55,404 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 201 flow [2024-10-13 12:25:55,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2024-10-13 12:25:55,405 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-10-13 12:25:55,405 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 201 flow [2024-10-13 12:25:55,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-13 12:25:55,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:55,405 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] [2024-10-13 12:25:55,411 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 (6)] Forceful destruction successful, exit code 0 [2024-10-13 12:25:55,610 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-10-13 12:25:55,610 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:55,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1062903228, now seen corresponding path program 1 times [2024-10-13 12:25:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678663512] [2024-10-13 12:25:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:55,612 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-10-13 12:25:55,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:55,614 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-10-13 12:25:55,615 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-10-13 12:25:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:55,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:25:55,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:55,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:55,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:55,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678663512] [2024-10-13 12:25:55,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678663512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:55,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:55,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:25:55,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671544489] [2024-10-13 12:25:55,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:55,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:25:55,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:55,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:25:55,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:25:55,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-10-13 12:25:55,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:25:55,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:55,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-10-13 12:25:55,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:55,853 INFO L124 PetriNetUnfolderBase]: 125/346 cut-off events. [2024-10-13 12:25:55,853 INFO L125 PetriNetUnfolderBase]: For 220/231 co-relation queries the response was YES. [2024-10-13 12:25:55,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 346 events. 125/346 cut-off events. For 220/231 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1724 event pairs, 30 based on Foata normal form. 21/356 useless extension candidates. Maximal degree in co-relation 838. Up to 142 conditions per place. [2024-10-13 12:25:55,856 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 18 selfloop transitions, 3 changer transitions 41/80 dead transitions. [2024-10-13 12:25:55,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 80 transitions, 433 flow [2024-10-13 12:25:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:25:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:25:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-10-13 12:25:55,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2024-10-13 12:25:55,858 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 201 flow. Second operand 5 states and 155 transitions. [2024-10-13 12:25:55,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 80 transitions, 433 flow [2024-10-13 12:25:55,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 80 transitions, 398 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-10-13 12:25:55,863 INFO L231 Difference]: Finished difference. Result has 66 places, 35 transitions, 143 flow [2024-10-13 12:25:55,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=66, PETRI_TRANSITIONS=35} [2024-10-13 12:25:55,864 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2024-10-13 12:25:55,864 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 35 transitions, 143 flow [2024-10-13 12:25:55,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:25:55,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:55,864 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-10-13 12:25:55,871 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-10-13 12:25:56,065 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-10-13 12:25:56,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:56,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1259582903, now seen corresponding path program 1 times [2024-10-13 12:25:56,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:56,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201476117] [2024-10-13 12:25:56,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:25:56,068 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-10-13 12:25:56,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:56,072 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-10-13 12:25:56,082 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-10-13 12:25:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:25:56,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:25:56,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:25:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:25:56,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:25:56,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:25:56,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201476117] [2024-10-13 12:25:56,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201476117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:25:56,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:25:56,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:25:56,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059450437] [2024-10-13 12:25:56,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:25:56,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:25:56,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:25:56,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:25:56,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:25:56,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-10-13 12:25:56,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 35 transitions, 143 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-10-13 12:25:56,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:25:56,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-10-13 12:25:56,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:25:56,407 INFO L124 PetriNetUnfolderBase]: 77/250 cut-off events. [2024-10-13 12:25:56,407 INFO L125 PetriNetUnfolderBase]: For 96/103 co-relation queries the response was YES. [2024-10-13 12:25:56,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 250 events. 77/250 cut-off events. For 96/103 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1180 event pairs, 30 based on Foata normal form. 10/258 useless extension candidates. Maximal degree in co-relation 596. Up to 94 conditions per place. [2024-10-13 12:25:56,409 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 34 selfloop transitions, 6 changer transitions 17/72 dead transitions. [2024-10-13 12:25:56,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 367 flow [2024-10-13 12:25:56,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:25:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:25:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2024-10-13 12:25:56,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5373737373737374 [2024-10-13 12:25:56,411 INFO L175 Difference]: Start difference. First operand has 66 places, 35 transitions, 143 flow. Second operand 11 states and 266 transitions. [2024-10-13 12:25:56,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 367 flow [2024-10-13 12:25:56,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 335 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-10-13 12:25:56,414 INFO L231 Difference]: Finished difference. Result has 63 places, 35 transitions, 163 flow [2024-10-13 12:25:56,414 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=163, PETRI_PLACES=63, PETRI_TRANSITIONS=35} [2024-10-13 12:25:56,415 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-10-13 12:25:56,415 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 35 transitions, 163 flow [2024-10-13 12:25:56,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-10-13 12:25:56,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:25:56,415 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-10-13 12:25:56,421 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-10-13 12:25:56,616 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-10-13 12:25:56,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:25:56,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:25:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash -490023219, now seen corresponding path program 2 times [2024-10-13 12:25:56,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:25:56,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496023246] [2024-10-13 12:25:56,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:25:56,618 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-10-13 12:25:56,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:25:56,622 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:25:56,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 12:25:56,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:25:56,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 12:25:56,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:25:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:25:56,734 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:25:56,738 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:25:56,740 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2024-10-13 12:25:56,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2024-10-13 12:25:56,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-13 12:25:56,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 12:25:56,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:25:56,947 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:25:57,031 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:25:57,031 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:25:57,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:25:57 BasicIcfg [2024-10-13 12:25:57,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:25:57,043 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:25:57,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:25:57,044 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:25:57,044 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:25:52" (3/4) ... [2024-10-13 12:25:57,046 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:25:57,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:25:57,048 INFO L158 Benchmark]: Toolchain (without parser) took 5523.35ms. Allocated memory was 65.0MB in the beginning and 98.6MB in the end (delta: 33.6MB). Free memory was 44.9MB in the beginning and 70.2MB in the end (delta: -25.2MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-13 12:25:57,049 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 22.9MB in the beginning and 22.9MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:25:57,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.01ms. Allocated memory is still 65.0MB. Free memory was 44.8MB in the beginning and 36.9MB in the end (delta: 7.9MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-10-13 12:25:57,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.47ms. Allocated memory is still 65.0MB. Free memory was 36.9MB in the beginning and 34.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:25:57,050 INFO L158 Benchmark]: Boogie Preprocessor took 58.70ms. Allocated memory is still 65.0MB. Free memory was 34.5MB in the beginning and 32.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:25:57,050 INFO L158 Benchmark]: RCFGBuilder took 687.66ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 32.2MB in the beginning and 34.2MB in the end (delta: -2.0MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-10-13 12:25:57,051 INFO L158 Benchmark]: TraceAbstraction took 4154.11ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 33.6MB in the beginning and 70.3MB in the end (delta: -36.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-10-13 12:25:57,051 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 98.6MB. Free memory was 70.3MB in the beginning and 70.2MB in the end (delta: 174.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:25:57,053 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 22.9MB in the beginning and 22.9MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.01ms. Allocated memory is still 65.0MB. Free memory was 44.8MB in the beginning and 36.9MB in the end (delta: 7.9MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.47ms. Allocated memory is still 65.0MB. Free memory was 36.9MB in the beginning and 34.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.70ms. Allocated memory is still 65.0MB. Free memory was 34.5MB in the beginning and 32.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 687.66ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 32.2MB in the beginning and 34.2MB in the end (delta: -2.0MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4154.11ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 33.6MB in the beginning and 70.3MB in the end (delta: -36.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 98.6MB. Free memory was 70.3MB in the beginning and 70.2MB in the end (delta: 174.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 683]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 683. Possible FailurePath: [L697] 0 volatile int stoppingFlag; [L698] 0 volatile int pendingIo; [L699] 0 volatile int stoppingEvent; [L700] 0 volatile int stopped; [L756] 0 pthread_t t; [L757] 0 pendingIo = 1 [L758] 0 stoppingFlag = 0 [L759] 0 stoppingEvent = 0 [L760] 0 stopped = 0 [L761] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L762] CALL 0 BCSP_PnpAdd(0) [L734] 0 int status; [L735] CALL, EXPR 0 BCSP_IoIncrement() [L703] 0 int lsf = stoppingFlag; VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L745] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L747] CALL 1 BCSP_IoDecrement() [L725] 1 int pending; [L726] CALL, EXPR 1 dec() [L705] COND FALSE 0 !(\read(lsf)) VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L709] 0 int lp = pendingIo; VAL [lp=1, lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L719] 1 pendingIo-- [L720] 1 int tmp = pendingIo; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L722] 1 return tmp; [L726] RET, EXPR 1 dec() [L726] 1 pending = dec() [L727] COND TRUE 1 pending == 0 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L729] 1 stoppingEvent = 1 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L747] RET 1 BCSP_IoDecrement() [L749] 1 int lse = stoppingEvent; VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L712] 0 pendingIo = lp + 1 VAL [lp=1, lsf=0, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1] [L751] CALL 1 assume_abort_if_not(lse) [L686] COND FALSE 1 !(!cond) [L751] RET 1 assume_abort_if_not(lse) [L715] 0 return 0; VAL [\result=0, lsf=0, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1] [L735] RET, EXPR 0 BCSP_IoIncrement() [L735] 0 status = BCSP_IoIncrement() [L736] COND TRUE 0 status == 0 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L752] 1 stopped = 1 VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L737] 0 int local_assertion = !stopped; VAL [\old(arg)={0:0}, arg={0:0}, local_assertion=0, pendingIo=2, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L738] CALL 0 __VERIFIER_assert(local_assertion) [L689] COND TRUE 0 !(cond) [L690] CALL 0 reach_error() [L683] COND FALSE 0 !(0) VAL [pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] [L683] 0 __assert_fail ("0", "assert.h", 6, __extension__ __PRETTY_FUNCTION__) VAL [pendingIo=2, stopped=1, stoppingEvent=1, stoppingFlag=1] - UnprovableResult [Line: 755]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 761]: 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 3 procedures, 54 locations, 3 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.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 647 IncrementalHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 22 mSDtfsCounter, 647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=4, InterpolantAutomatonStates: 40, 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 12 NumberOfNonLiveVariables, 317 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-10-13 12:25:57,087 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